Author:
Paul Christophe,Telle Jan Arne
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Lecture Notes in Computer Science;H.L. Bodlaender,1997
2. Bodlaender, H.L., Thilikos, D.M.: Graphs with branchwidth at most three. Journal of Algorithms 32, 167–194 (1999)
3. Booth, K., Lueker, G.: Testing of the consecutive ones property, interval graphs, and graph planarity testing using PQ-tree algorithms. Journal of Computer and System Sciences 13, 335–379 (1976)
4. Cook, W., Seymour, P.D.: Tour merging via branch-decompositions. Journal on Computing 15, 233–248 (2003)
5. Lecture Notes in Computer Science;E. Demaine,2003
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tangle bases: Revisited;Networks;2020-08-21
2. Branchwidth of Graphs;Encyclopedia of Algorithms;2016
3. Generation of Graphs with Bounded Branchwidth;Graph-Theoretic Concepts in Computer Science;2006
4. Edge-maximal graphs of branchwidth k;Electronic Notes in Discrete Mathematics;2005-10
5. Mixed Search Number and Linear-Width of Interval and Split Graphs;Graph-Theoretic Concepts in Computer Science