Tree-length equals branch-length
From MaRDI portal
Publication:1044006
DOI10.1016/J.DISC.2009.01.009zbMATH Open1221.05061OpenAlexW1975003797MaRDI QIDQ1044006FDOQ1044006
Authors: Kaori Umezawa, Koichi Yamazaki 
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.01.009
Recommendations
- Consistent formulas for estimating the total lengths of trees
- scientific article; zbMATH DE number 3972891
- Tree-width and dimension
- The total path length of split trees
- scientific article; zbMATH DE number 4041950
- Path length and height in asymmetric binary branching trees
- Mean distance in a tree
- Connected tree-width
- On graphoidal length of a tree in terms of its diameter
- Branches in scale-free trees
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- Graph Classes: A Survey
- Spanners for bounded tree-length graphs
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- Treewidth: Characterizations, Applications, and Computations
- On the Complexity of Computing Treelength
- Title not available (Why is that?)
- Tree-decompositions with bags of small diameter
- Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs
- Algorithms – ESA 2005
This page was built for publication: Tree-length equals branch-length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1044006)
