Author:
Ganian Robert,Hliněný Petr
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. Finite automata, bounded treewidth, and well-quasiordering;Abrahamson,1993
2. Problems easy for tree-decomposible graphs;Arnborg,1988
3. Distance-hereditary graphs;Bandelt;J. Combin. Theory Ser. B,1986
4. H-join decomposable graphs and algorithms with runtime single exponential in rankwidth;Bui-Xuan;Discrete Appl. Math.,2010
5. On the relationship between cliquewidth and treewidth;Corneil;SIAM J. Comput.,2005
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fast FPT-Approximation of Branchwidth;SIAM Journal on Computing;2024-08-08
2. Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Slim Tree-Cut Width;Algorithmica;2024-06-01
4. Hardness transitions and uniqueness of acyclic colouring;Discrete Applied Mathematics;2024-03
5. Fast FPT-approximation of branchwidth;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09