Undirected Graphs of Entanglement 2

Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the problem of deciding whether a graph has entanglement at most k. As this measure is defined by means of games, game theoretic ideas naturally lead to design polynomial algorithms that, for fixed k, decide the problem. Known characterizations of directed graphs of entanglement at most 1 lead, for k = 1, to design even faster algorithms. In this paper we give two distinct characterizations of undirected graphs of entanglement at most 2. With these characterizations at hand, we present a linear time algorithm to decide whether an undirected graph has this property.

[1]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[2]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[3]  Walter Hohberg.  The decomposition of graphs into k -connected components , 1992 .

[4]  Walid Belkhir.  Algebra and Combinatorics of Parity Games , 2008 .

[5]  A. Arnold,et al.  Rudiments of μ-calculus , 2001 .

[6]  Robin Thomas,et al.  Directed Tree-Width , 2001, J. Comb. Theory, Ser. B.

[7]  Paul D. Seymour,et al.  Circular embeddings of planar graphs in nonspherical surfaces , 1994, Discret. Math..

[8]  Marcin Jurdzinski,et al.  Small Progress Measures for Solving Parity Games , 2000, STACS.

[9]  W. T. Tutte.  Connectivity in graphs , 1966 .

[10]  Igor Walukiewicz,et al.  Games and Logical Expressiveness , 2005 .

[11]  Georg Gottlob,et al.  Hypertree Decompositions: A Survey , 2001, MFCS.

[12]  Feodor F. Dragan,et al.  Finding a central vertex in an HHD-free graph , 2003, Discret. Appl. Math..

[13]  S. Olariu,et al.  On the semi-perfect elimination , 1988 .

[14]  P. Gács,et al.  Algorithms , 1992 .

[15]  Brigitte Servatius,et al.  The Structure of Locally Finite Two-Connected Graphs , 1995, Electron. J. Comb..

[16]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[17]  Dietmar Berwanger,et al.  Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games , 2005, LPAR.

[18]  Dietmar Berwanger,et al.  The Variable Hierarchy of the μ-Calculus Is Strict , 2006, Theory of Computing Systems.

[19]  Bruno Courcelle,et al.  Graph Rewriting: An Algebraic and Logic Approach , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[20]  Panos M. Pardalos,et al.  Feedback Set Problems , 1999, Handbook of Combinatorial Optimization.

[21]  K. Wagner.  Über eine Eigenschaft der ebenen Komplexe , 1937 .

[22]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[23]  Dietmar Berwanger,et al.  On the Variable Hierarchy of the Modal µ-Calculus , 2002, CSL.

[24]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.

[25]  Eric Goubault,et al.  Dihomotopy as a Tool in State Space Analysis , 2002, LATIN.

[26]  Peter Bro Miltersen,et al.  On Pseudorandom Generators in NC , 2001, MFCS.

[27]  Michel Rigo,et al.  Abstract numeration systems and tilings , 2005 .

[28]  Stephan Kreutzer,et al.  DAG-Width and Parity Games , 2006, STACS.

[29]  Luigi Santocanale,et al.  The Variable Hierarchy for the Lattice µ-Calculus , 2008, LPAR.

[30]  Walter Holberg,et al.  The decomposition of graphs into k-connected components , 1992, Discret. Math..

[31]  R. Bruce Richter.  Decomposing Infinite 2-Connected Graphs into 3-Connected Components , 2004, Electron. J. Comb..

[32]  Dietmar Berwanger,et al.  The Variable Hierarchy of the µ-Calculus Is Strict , 2005, STACS.

[33]  Etienne Birmelé.  Tree-width and circumference of graphs , 2003, J. Graph Theory.

[34]  M. Ziegler.  Volume 152 of Graduate Texts in Mathematics , 1995 .

[35]  Sergio Rajsbaum,et al.  LATIN 2002: Theoretical Informatics , 2002, Lecture Notes in Computer Science.

[36]  N. Meyers,et al.  H = W. , 1964, Proceedings of the National Academy of Sciences of the United States of America.

[37]  Jirí Adámek,et al.  What Are Iteration Theories? , 2007, MFCS.

[38]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[39]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[40]  Mohammad Ali Safari.  D-Width: A More Natural Measure for Directed Tree Width , 2005, MFCS.