Testing branch-width

Journal of Combinatorial Theory. Series B

Volumn 97, Issue 3, 2007, Pages 385-393

  Oum, Sang il ^a   Seymour, Paul ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Branch width; Carving width; Connectivity function; Rank width; Symmetric submodular function; Tangle

Indexed keywords

EID: 33847679508     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2006.06.006     Document Type: Article

References (7)

1. Bodlaender H.L., and Thilikos D.M. Constructive linear time algorithms for branchwidth. Automata, Languages and Programming. Bologna, 1997. Lecture Notes in Comput. Sci. vol. 1256 (1997), Springer, Berlin 627-637
2. Hliněný P. A parametrized algorithm for matroid branch-width. SIAM J. Comput. 35 (2005) 259-277
3. Iwata S., Fleischer L., and Fujishige S. A combinatorial strongly polynomial algorithm for minimizing submodular functions. J. ACM 48 (2001) 761-777
4. S. Oum, Graphs of bounded rank-width, PhD thesis, Princeton University, 2005
5. Robertson N., and Seymour P. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 52 (1991) 153-190
6. Schrijver A. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. J. Combin. Theory Ser. B 80 (2000) 346-355
7. Thilikos D.M., Serna M.J., and Bodlaender H.L. Constructive linear time algorithms for small cutwidth and carving-width. Algorithms and Computation. Taipei, 2000. Lecture Notes in Comput. Sci. vol. 1969 (2000), Springer, Berlin 192-203