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 Kellywidth 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 Kellywidth at least 3, in time linear in H. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Meister, D., Telle, J. A., & Vatshelle, M. (2007). Characterization and recognition of digraphs of bounded Kelly-width. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4769 LNCS, pp. 270–279). Springer Verlag. https://doi.org/10.1007/978-3-540-74839-7_26
Mendeley helps you to discover research relevant for your work.