Abstract
Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal μ-calculus is strict. While graphs of entanglement zero and one are indeed very simple, some graphs of entanglement two already contain interesting nesting of cycles. This motivates our study of the class of graphs of entanglement two, as these are both simple in a sense and already complex enough for modelling certain structured systems.
Undirected graphs of entanglement two were already studied by Belkhir and Santocanale and a structural decomposition for such graphs was given. We study the general case of directed graphs of entanglement two and prove that they can be decomposed as well, in a way similar to the known decompositions for tree-width, DAG-width and Kelly-width. Moreover, we show that all graphs of entanglement two have both DAG-width and Kelly-width three. Since there exist both graphs with DAG-width three and graphs with Kelly-width three, but with arbitrary high entanglement, this confirms that graphs of entanglement two are a very basic class of graphs with cycles intertwined in an interesting way.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
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)
Obdržálek, J.: Dag-width: connectivity measure for directed graphs. In: Proc. of SODA 2006, pp. 814–821. ACM Press, New York (2006)
Kreutzer, S., Ordyniak, S.: Digraph decompositions and monotonicity in digraph searching. CoRR abs/0802.2228 (2008)
Hunter, P., Kreutzer, S.: Digraph measures: Kelly decompositions, games, and orderings. In: Proc. of SODA 2007, pp. 637–644. SIAM, Philadelphia (2007)
Berwanger, D., Grädel, E.: Entanglement — a measure for the complexity of directed graphs with applications to logic and games. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol. 3452, pp. 209–223. Springer, Heidelberg (2005)
Johnson, T., Robertson, N., Seymour, P.D., Thomas, R.: Directed tree-width. J. Comb. Theory, Ser. B 82(1), 138–154 (2001)
Eggan, L.C.: Transition graphs and the star-height of regular events. Michigan Math. J. 10, 385–397 (1963)
Safari, M.A.: D-width, metric embedding, and their connections. PhD thesis, Vancouver, BC, Canada (2007)
Hunter, P.: Complexity and Infinite Games on Finite Graphs. PhD thesis, Computer Laboratory, University of Cambridge (2007)
Rabinovich, R.: Complexity measures of directed graphs. Diploma thesis, RWTH-Aachen (2008)
Berwanger, D., Grädel, E., Lenzi, G.: The variable hierarchy of the μ-calculus is strict. Theory of Computing Systems 40, 437–466 (2007)
Dawar, A., Grädel, E.: The descriptive complexity of parity games. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 354–368. Springer, Heidelberg (2008)
Grädel, E., Kaiser, Ł., Rabinovich, R.: Directed graphs of entanglement two (Full version) (2009), www.logic.rwth-aachen.de/Publications
Belkhir, W., Santocanale, L.: Undirected graphs of entanglement 2. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 508–519. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grädel, E., Kaiser, Ł., Rabinovich, R. (2009). Directed Graphs of Entanglement Two. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds) Fundamentals of Computation Theory. FCT 2009. Lecture Notes in Computer Science, vol 5699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03409-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-03409-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03408-4
Online ISBN: 978-3-642-03409-1
eBook Packages: Computer ScienceComputer Science (R0)