Searching for "Domino Treewidth." – sorted by Relevance.
10 documents found, showing 1 through 10.
-
Domino Treewidth
- …Domino Treewidth Hans L. Bodlaender Joost Engelfriet UU-CS-1994-11 February 1994 \Delta Utrecht…
- Cited by 45 (3 self) – Add To MetaCart
-
A Note on Domino Treewidth
- …Discrete Mathematics and Theoretical Computer Science 3, 1999, 141--150 A note on domino treewidth…
- Add To MetaCart
-
Bounded Persistence Pathwidth
- … treewidth introduced by Bodlaender and Engelfriet (Bodlaender & Engelfreit 1997). A domino tree…
- Cited by 1 (1 self) – Add To MetaCart
-
Compendium of Parameterized Problems
- …: direct proof [52]; hardness: trivial reduction from Dominating Set) 16 Domino Treewidth Instance: A…
- Cited by 3 (0 self) – Add To MetaCart
-
Parameterized Complexity for the Skeptic
- … COLORED GRAPHS, BANDWIDTH, PROPER INTERVAL GRAPH COMPLE- TION ([BFH94]), DOMINO TREEWIDTH ([BE97]) and 5…
- Cited by 29 (1 self) – Add To MetaCart
-
The Hardness of Problems on Thin Colored Graphs
- …, Bandwidth, Domino Treewidth, and Uniform Emulation on a Path (see [37]). If any one these problems complete…
- Cited by 1 (1 self) – Add To MetaCart
-
Online problems, pathwidth, and persistence
- … should look more like a “long 2-path” than a “fuzzy ball”. A related notion is domino treewidth…
- Cited by 2 (1 self) – Add To MetaCart
-
Parameterized Complexity for the Skeptic
- … COLORED GRAPHS, BANDWIDTH, PROPER INTERVAL GRAPH COMPLE- TION ([BFH94]), DOMINO TREEWIDTH ([BE97]) and 5…
- Add To MetaCart
-
The Hardness of Perfect Phylogeny, Feasible Register Assignment and Other Problems on Thin Colored Graphs
- …, Domino Treewidth, and Uniform Emulation on a Path (see [36]). If any one of these problems is FPT…
- Cited by 12 (3 self) – Add To MetaCart
-
Parameterized complexity and approximability of the SLCS problem
- … Cutwidth, Feasible Register Assignment, Domino Treewidth, Triangulating Colored Graphs are WNL-hard. We now…
- Cited by 2 (1 self) – Add To MetaCart
Showing 1 through 10.
