Introducing directed tree width. (English) Zbl 1072.05579
Broersma, H. J. (ed.) et al., 6th Twente workshop on graphs and combinatorial optimization. Univ. of Twente, Enschede, Netherlands, May 26–28, 1999. Extended abstracts. Amsterdam: Elsevier. Electron. Notes Discrete Math. 3, no pag., electronic only (1999).
Summary: Tree width is an important new measure of a graph’s global connectivity. We discuss a directed variant of this notion introduced by Johnson, Robertson, Seymour, and Thomas.
For the entire collection see [Zbl 0968.90002].
For the entire collection see [Zbl 0968.90002].
MSC:
| 05C85 | Graph algorithms (graph-theoretic aspects) |
