Tree-length equals branch-length

Discrete Mathematics

Volumn 309, Issue 13, 2009, Pages 4656-4660

  Umezawa, Kaori ^a   Yamazaki, Koichi ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

Branch length; Tree length

Indexed keywords

BRANCH DECOMPOSITIONS; BRANCH-LENGTH; GRAPH PARAMETERS; SMALL DIAMETERS; TREE DECOMPOSITIONS; TREE-LENGTH;

DECOMPOSITION;

GRAPH THEORY;

EID: 67349119571     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2009.01.009     Document Type: Article

References (11)

1. Bodlaender H.L. Treewidth: Characterizations, Applications, and Computations, Proceedings of WG 2006. LNCS vol. 4271 (2006) 1-14
2. Brandstädt A., Le V.B., and Spinrad J.P. Graph Classes: A Survey (1999), SIAM
3. Dourisboure Y. Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs, DISC 2004. LNCS vol. 3274 (2004) 365-378
4. Dourisboure Y., Dragan F.F., Gavoille C., and Yan C. Spanners for bounded tree-length graphs. Theoret. Comput. Sci. 383 (2007) 34-44
5. Dourisboure Y., and Gavoille C. Tree-decompositions with bags of small diameter. Discrete Math. 307 (2007) 2008-2029
6. Fomin F.V., and Thilikos D.M. Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM J. Comput. 36 (2006) 281-309
7. Gavoille C., Katz M., Katz N.A., Paul C., and Peleg D. Approximate Distance Labeling Schemes, ESA 2001. LNCS vol. 2161 (2001) 476-488
8. Lokshtanov D. On the Complexity of Computing Treelength, MFCS 2007. LNCS vol. 4708 (2007) 276-287
9. Paul C., and Telle J.A. New Tools and Simpler Algorithms for Branchwidth, ESA 2005. LNCS vol. 3669 (2005) 379-390
10. Robertson N., and Seymour P.D. Graph minor X. Obstructions to tree-decomposition. J. Combin. Theory B 52 (1991) 153-190
11. R. Thomas, Tree-decompositions of graphs, Lecture notes, School of Mathematics, Georgia Institute of Technology, Atlanta, Georgia 30332, USA, 1996