Filters
Show more
Show more
Show more
Show more
Show more
Show more
Show more
Show more
More filters
Results
Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
We present a robust fixed parameter tractable algorithm for finding an independent set of size k in segment intersection graphs in d directions....
BA - Obecná matematika
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Edge-Editing to a Dense and a Sparse Graph Class
, investigating what properties of the classes make the problem fixed-parameter tractable. We of editing to this class is fixed-parameter tractable parameterized by the cost. Under is fixed
IN - Informatika
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
and at most $e$ postconditions is fixed-parameter tractable if $eleq 2$ and W[1]-complete otherwise. We show fixed-parameter tractability by a reduction to a variant of the Steiner Tree problem; ...
BD - Teorie informace
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Backdoors to Tractable Valued CSP
. We establish that VCSP is fixed-parameter tractable when parameterized by the size of a smallest backdoor into every tractable class of VCSP instances and finite domain. We further extend this fixed-...
IN - Informatika
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract)
We study computational complexity of the class of distance-constrained graph labeling problems from the fixed parameter tractability point of view. The parameters studied are neighborhood diversity and clique width...
IN - Informatika
- 2016 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
consideration. We study the fixed parameter tractability of basic graph theoretic problems. Our resultsshow that most of these problems remain fixed parameter tractable as well, and thus we push ...
IN - Informatika
- 2012 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Winter School on Algorithm Design
A school on algorithm theory and design held in Beroun on December 12-15, 2013. The school included three series of talks by foreign experts on finite model theory, fixed parameter tractability and constraint satisfaction a...
IN - Informatika
- 2013 •
- W •
- Link
Rok uplatnění
W - Uspořádání workshopu
Výsledek na webu
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem
We develop an FPT algorithm and a compression for the Weighted Edge Clique Partition (WECP) problem, where a graph with n vertices and integer edge weights is given together with an integer k, and the aim is to find k cliques, such that every edge ap...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2020 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Sum-of-Products with Default Values: Algorithms and Complexity Results
that the problem is fixed-parameter tractable for the combined parameter incidence treewidth in a constraint), generalizing a known result on the fixed-parameter tractability of #CSPD th...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2018 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Finding branch-decomposition and rank-decomposition (Extended abstract)
. Both these algorithms are fixed-parameter tractable, that is, they run in time $O(n^3)$ for each fixed value of $k$ where $n$ is the number of vertices / elements matroid represented over a fixed finite ...
IN - Informatika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 84 232