Name
Abstract | ||
|---|---|---|
The graph parameter tree-length, which is defined in terms of Robertson-Seymour's tree decomposition, was introduced by Dourisboure and Gavoille [Y. Dourisboure, C. Gavoille, Tree-decompositions with bags of small diameter, Discrete Math. 307 (2007) 2008-2029], and has recently been studied. In this paper, we introduce a new graph parameter branch-length, which is defined in terms of Robertson-Seymour's branch decomposition. We also prove the equivalence between tree-length and branch-length. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.disc.2009.01.009 | Discrete Mathematics |
Keywords | Field | DocType |
branch-length,tree-length,tree decomposition | Graph,Discrete mathematics,Combinatorics,Tree (graph theory),Tree decomposition,Decomposition method (constraint satisfaction),Equivalence (measure theory),Mathematics,Branch-decomposition | Journal |
Volume | Issue | ISSN |
309 | 13 | Discrete Mathematics |
Citations | PageRank | References |
3 | 0.42 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kaori Umezawa | 1 | 3 | 0.42 |
| Koichi Yamazaki | 2 | 222 | 21.85 |