Searching for "Structure Theory and FPT Algorithmics for Graphs" – sorted by Relevance.
-
Approximating rank-width and clique-width quickly
- -decompositions and rank-decompositions, Structure Theory and FPT Algorithms for Graphs, Digraphs and Hypergraphs, Dagstuhl
- Cited by 17 (1 self) – Add To MetaCart
-
Directed Feedback Vertex Set is Fixed-Parameter Tractable
- problem in time O(2 k k! ∗ Dagstuhl Seminar Proceedings 07281 Structure Theory and FPT Algorithmics
- Cited by 1 (1 self) – Add To MetaCart

