Entanglement is a complexity measure for directed graphs that was used to show that the variable hierarchy of the propositional modal $\mu$-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.
@inproceedings{GKR09,
author = {Erich Grädel and Łukasz Kaiser and Roman Rabinovich},
title = {Directed Graphs of Entanglement Two},
booktitle = {Proceedings of the 17th International Symposium on Fundamentals of Computation Theory, FCT '09},
publisher = {Springer},
series = {LNCS},
volume = {5699},
year = {2009},
pages = {169–181},
url = {http://logic.rwth-aachen.de/~kaiser/entanglement2.pdf},
}
@misc{Rabinovich08,
author = {Roman Rabinovich},
title = {Complexity Measures of Directed Graphs},
howpublished = {Diploma thesis, RWTH-Aachen},
year = {2008},
url = {http://logic.rwth-aachen.de/People/Rabinovich/diplomarbeit.pdf},
}