Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects

Graph structureis a flexible concept covering many different types of graph properties. Hierarchical decompositions yielding the notions of tree-width and clique-width, expressed by terms written with appropriate graph operations and associated with Monadic Second-order Logicare important tools for the construction of Fixed-Parameter Tractable algorithms and also for the extension of methods and results of Formal Language Theory to the description of sets of finite graphs. This informal overview presents the main definitions, results and open problems and tries to answer some frequently asked questions.

[1]  Nils Klarlund,et al.  Mona & Fido: The Logic-Automaton Connection in Practice , 1997, CSL.

[2]  Bruno Courcelle,et al.  Recognizability, hypergraph operations, and logical types , 2006, Inf. Comput..

[3]  Egon Wanke,et al.  k-NLC Graphs and Polynomial Algorithms , 1994, Discret. Appl. Math..

[4]  Hans L. Bodlaender,et al.  Treewidth: Characterizations, Applications, and Computations , 2006, WG.

[5]  Bruno Courcelle,et al.  Vertex-minors, monadic second-order logic, and a conjecture by Seese , 2007, J. Comb. Theory, Ser. B.

[6]  Joost Engelfriet,et al.  Clique-Width for 4-Vertex Forbidden Subgraphs , 2006, Theory of Computing Systems.

[7]  Bruno Courcelle,et al.  The recognizability of sets of graphs is a robust property , 2005, Theor. Comput. Sci..

[8]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected Graphs , 1999, Theor. Comput. Sci..

[9]  Johann A. Makowsky,et al.  Erratum to "Arity and Alternation in Second-Order Logic" , 1998, Ann. Pure Appl. Log..

[10]  B. COURCELLE,et al.  Fusion in relational structures and the verification of monadic second-order properties , 2002, Mathematical Structures in Computer Science.

[11]  Jörg Flum,et al.  Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) , 2006 .

[12]  Detlef Seese,et al.  The Structure of Models of Decidable Monadic Theories of Graphs , 1991, Ann. Pure Appl. Log..

[13]  Johann A. Makowsky,et al.  Arity and Alternation in Second-Order Logic , 1996, Ann. Pure Appl. Log..

[14]  Bruno Courcelle,et al.  The monadic second-order logic of graphs XII: planar graphs and planar maps , 2000, Theor. Comput. Sci..

[15]  W. T. Tutte.  Graph Theory , 1984 .

[16]  Jesse B. Wright,et al.  Algebraic Automata and Context-Free Sets , 1967, Inf. Control..

[17]  Grzegorz Rozenberg,et al.  Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations , 1997 .

[18]  Derick Wood,et al.  Theory of computation , 1986 .

[19]  Martin Grohe,et al.  Logic, graphs, and algorithms , 2007, Logic and Automata.

[20]  Bruno Courcelle,et al.  The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic , 1997, Handbook of Graph Grammars.

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

[22]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[23]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[24]  Petr Hlinený,et al.  Finding Branch-Decompositions and Rank-Decompositions , 2007, ESA.

[25]  S. E. Markosyan,et al.  ω-Perfect graphs , 1990 .

[26]  Martin Grohe,et al.  The complexity of first-order and monadic second-order logic revisited , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[27]  Robin Thomas,et al.  Progress on perfect graphs , 2003, Math. Program..

[28]  David Soguet.  Génération automatique d'algorithmes linéairesDécomposition de graphes, logique, stratégies de capture , 2008 .

[29]  Joost Engelfriet,et al.  Regular Description of Context-Free Graph Languages , 1996, J. Comput. Syst. Sci..

[30]  Bruno Courcelle,et al.  The monadic second-order logic of graphs XVI : Canonical graph decompositions , 2005, Log. Methods Comput. Sci..

[31]  Feodor F. Dragan,et al.  New Graph Classes of Bounded Clique-Width , 2002, Theory of Computing Systems.

[32]  Michael Hoffmann,et al.  Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings , 2007, ESA.

[33]  Jaroslav Nesetril,et al.  Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.

[34]  T. Gallai.  Transitiv orientierbare Graphen , 1967 .

[35]  Martin Otto,et al.  Back and forth between guarded and modal logics , 2002, TOCL.

[36]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[37]  W. Cunningham.  Decomposition of Directed Graphs , 1982 .

[38]  Bruno Courcelle,et al.  The monadic second-order logic of graphs XV: On a conjecture by D. Seese , 2006, J. Appl. Log..

[40]  Paul D. Seymour,et al.  Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[41]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[42]  Joost Engelfriet,et al.  Logical Description of Contex-Free Graph Languages , 1997, J. Comput. Syst. Sci..

[43]  Udi Rotics,et al.  Clique-width minimization is NP-hard , 2006, STOC '06.

[44]  Thomas Wilke,et al.  Logic and automata : history and perspectives , 2007 .

[45]  Paul D. Seymour,et al.  Approximating clique-width and branch-width , 2006, J. Comb. Theory, Ser. B.

[46]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures , 1992, Theor. Comput. Sci..

[47]  Dieter Kratsch,et al.  Graph-Theoretic Concepts in Computer Science , 1987, Lecture Notes in Computer Science.

[48]  Florent R. Madelaine.  Universal Structures and the Logic of Forbidden Patterns , 2006, CSL.

[49]  Bruno Courcelle,et al.  A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars , 1995, Math. Syst. Theory.

[50]  B. Mohar,et al.  Graph Minors , 2009 .

[51]  Hartmut Ehrig,et al.  Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution , 1999 .

[52]  Christof Löding,et al.  Logical theories and compatible operations , 2007, Logic and Automata.

[53]  Sang-il Oum,et al.  Rank-width and vertex-minors , 2005, J. Comb. Theory, Ser. B.

[54]  Jaroslav Nesetril,et al.  Linear time low tree-width partitions and algorithmic consequences , 2006, STOC '06.

[55]  Bruno Courcelle,et al.  The Monadic Second-Order Logic of Graphs X: Linear Orderings , 1996, Theor. Comput. Sci..

[56]  Johann A. Makowsky,et al.  Algorithmic uses of the Feferman-Vaught Theorem , 2004, Ann. Pure Appl. Log..

[57]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[58]  Johann A. Makowsky,et al.  Tree-width and the monadic quantifier hierarchy , 2003, Theor. Comput. Sci..

[59]  Paul D. Seymour,et al.  Graph minors. VIII. A kuratowski theorem for general surfaces , 1990, J. Comb. Theory, Ser. B.

[60]  Markus Frick,et al.  Generalized Model-Checking over Locally Tree-Decomposable Classes , 2003, Theory of Computing Systems.

[61]  Bruno Courcelle,et al.  The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications , 2003, Theor. Comput. Sci..

[62]  Bruno Courcelle,et al.  Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems , 1998, Ann. Pure Appl. Log..

[63]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[64]  Paul D. Seymour,et al.  Graph Minors. XVI. Excluding a non-planar graph , 2003, J. Comb. Theory, Ser. B.

[65]  Denis Lapoire,et al.  Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width , 1998, STACS.

[66]  Bruno Courcelle,et al.  Circle graphs and monadic second-order logic , 2008, J. Appl. Log..

[67]  Bruno Courcelle,et al.  Handle-Rewriting Hypergraph Grammars , 1993, J. Comput. Syst. Sci..