Abstract
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea of tree decomposition to directed graphs, but since many parameters in tree-width behave very differently in the world of digraphs, the generalization is still in its preliminary steps.
In this paper, after surveying the main work that has been done on this topic, we propose a new simple definition for directed tree-width and prove a special case of the min-max theorem (duality theorem) relating haven order, bramble number, and tree-width on digraphs. We also compare our definition with previous definitions and study the behavior of some tree-width like parameters such as brambles and havens on digraphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellenbaum, P., Diestel, R.: Two short proofs concerning tree-decompositions. Combinatoric, Probability and Computing 11, 1–7 (2002)
Bodlaender, H.L.: A tourist guide through treewidth. In: Acta Cybernetica, pp. 1–21 (1993)
Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed Tree-Width. Journal of Combinatorial Theory(Series B) 82, 128–154 (2001)
Reed, B.: Tree Width and Tangles: A New Connectivity Measure And Some Applications. Suervey in Combinatorics 241, 87–158 (1997)
Reed, B.: Introducing directed tree width. In: Broersma, H.J., Faigle, U., Hoede, C., Hurink, J.L. (eds.) Electronic Notes in Discrete Mathematics, vol. 3, Elsevier, Amsterdam (2000)
Reed, B., Robertson, N., Seymour, P., Thomas, R.: On packing directed circuits. Combinatorica 16, 535–554 (1996)
Robertson, N., Seymour, P.D.: Graph minors II: algorithmic aspects of tree-width. Journal Algorithms 7, 309–322 (1986)
Safari, M.A.: Directed tree-width. Master’s thesis, School of Computer Science, University of Waterloo (2003)
Seymour, P., Thomas, R.: Graph searching, and a min-max theorem for treewidth. Journal of Combinatorial Theory (Series B) 58, 239–257 (1993)
Younger, D.H.: Graphs with interlinked directed circuits. In: Proceedings of the Mid-west Symposium on Circuit Theory, vol. 2, p XVI 2.1 – XVI 2.7 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Safari, M.A. (2005). D-Width: A More Natural Measure for Directed Tree Width. In: Jȩdrzejowicz, J., Szepietowski, A. (eds) Mathematical Foundations of Computer Science 2005. MFCS 2005. Lecture Notes in Computer Science, vol 3618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549345_64
Download citation
DOI: https://doi.org/10.1007/11549345_64
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28702-5
Online ISBN: 978-3-540-31867-5
eBook Packages: Computer ScienceComputer Science (R0)