Abstract
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of directed graphs of bounded Kelly-width in support of this analogy. We apply these results to give the first polynomial-time algorithm recognizing directed graphs of Kelly-width 2. For an input directed graph G = (V, A) the algorithm will output a vertex ordering and a directed graph H = (V, B) with A ⊆ B witnessing either that G has Kelly-width at most 2 or that G has Kelly-width at least 3, in time linear in H.
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
Berwanger, D., Dawar, A., Hunter, P., Kreutzer, S.: DAG-Width and Parity Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 524–536. Springer, Heidelberg (2006)
Bodlaender, H.L.: Treewidth: Characterizations, Applications, and Computations. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 1–14. Springer, Heidelberg (2006)
Hunter, P., Kreutzer, S.: Digraph Measures: Kelly Decompositions, Games, and Orderings. In: SODA 2007. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 637–644. ACM Press, New York (2007)
Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed Tree-Width. Journal of Combinatorial Theory, Series B 82, 138–154 (2001)
Meister, D., Telle, J.A., Vatshelle, M.: Characterization and recognition of digraphs of bounded Kelly-width. Technical report no. 351, Institutt for Informatikk, Universitetet i Bergen (2007)
Obdržálek, J.: DAG-width – Connectivity Measure for Directed Graphs. In: SODA 2006. Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 814–821. ACM Press, New York (2006)
Safari, M.A.: D-Width: A More Natural Measure for Directed Tree Width. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol. 3618, pp. 745–756. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meister, D., Telle, J.A., Vatshelle, M. (2007). Characterization and Recognition of Digraphs of Bounded Kelly-width. In: Brandstädt, A., Kratsch, D., Müller, H. (eds) Graph-Theoretic Concepts in Computer Science. WG 2007. Lecture Notes in Computer Science, vol 4769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74839-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-74839-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74838-0
Online ISBN: 978-3-540-74839-7
eBook Packages: Computer ScienceComputer Science (R0)