Advertisement

The monadic second-order logic of graphs : Definable sets of finite graphs

  • Bruno Courcelle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 344)

Abstract

Every set of finite graphs definable in monadic second-order logic is recognizable in the algebraic sense of Mezei and Wright (no "graph automaton" is provided). We apply this result to the comparison of several definitions of sets of finite graphs , in particular by context-free graph grammars, and by forbidden configurations. It follows that the monadic second order theory of a context-free set of graphs is decidable, and that every graph property expressible in monadic second-order logic is decidable in polynomial time for graphs of a given maximal tree-width.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    ARNBORG S., CORNEIL D., PROSKUROWSKI A., Complexity of finding an embedding in a k-tree. SIAM J. of Alg. and Discr. Methods 8 (1987) 277–284Google Scholar
  2. [2]
    ARNBORG S., PROSKUROWSKI A., Linear time algorithms for port TRITA NA 8404 (1984), Stockolm.Google Scholar
  3. [3]
    ARNBORG S., LAGERGREN J., SEESE D., Which problems are easy for tree decomposable graphs ? Preprint, Nov. 1987, and Proc. of ICALP' 88, Tampere, Lec. Notes in Comput. Sci. 317, pp. 38–51.Google Scholar
  4. [4]
    BAUDERON M., COURCELLE B., Graph expressions and graph rewritings, Math Systems Theory 20 (1987) 83–127Google Scholar
  5. [5]
    BODLAENDER H., Dynamic programming on graphs with bounded tree-width, Proc. ICALP' 88, Lec. Notes Comp. Sci. 317, pp. 105–132.Google Scholar
  6. [6]
    BODLAENDER H., NC-algorithms for graphs with small tree-width, this volume.Google Scholar
  7. [7]
    COURCELLE B., Equivalences and transformations of regular systems. Applications to recursive program schemes and grammars, Theor. Comp. Sci. 42 (1986) 1–122.Google Scholar
  8. [8]
    COURCELLE B., Recognizability and second order defi nability for sets of finite graphs, Report I-8634, (revised version: The monadic second order logic of graphs, I: Recognizable sets of finite graphs, to appear).Google Scholar
  9. [9]
    COURCELLE B., An axiomatic definition of context-free rewriting and its application to NLC graph grammars, Theoret. Comput. Sci. 55 (1987) 141–181.Google Scholar
  10. [10]
    COURCELLE B., A representation of graphs by algebraic expressions and its use for graph rewriting systems, Proceedings of the 3rd international workshop on graph grammars, Warrenton, Virginia, 1986 in Lec. Notes Comput. Science vol. 291, 1987 pp. 112–133Google Scholar
  11. [11]
    COURCELLE B., On context-free sets of graphs and their monadic 2nd-order theory, same volume as [10], pp. 133–146.Google Scholar
  12. [12]
    COURCELLE B., On recognizable sets and tree-automata Report 8736, Proc. of the Conference on the resolution of equations in algebraic structures (CREAS), M. Nivat and H. Ait-Kaci eds., Academic Press, to appear in 1989.Google Scholar
  13. [13]
    COURCELLE B., On the use of context-free graph grammars for analyzing recursive definitions, Second French-Japanese Seminar, L. Kott ed., North-Holland, to appear in 1988.Google Scholar
  14. [14]
    DONER J., Tree acceptors and some of their applications J. Comput. System Sci. 4 (1970) 406–451.Google Scholar
  15. [15]
    JOHNSON D., The NP-completeness column: an ongoing guide, (16th), J. of Algorithms 6 (1985) 434–451.Google Scholar
  16. [16]
    JOHNSON D., The NP-completeness column: An ongoing guide (19 th), J. of Algorithms 8 (1987) 285–303.Google Scholar
  17. [17]
    HABEL A., Graph-theoretic properties compatible with graph derivations, this volume.Google Scholar
  18. [18]
    HABEL A., KREOWSKI H. J., Some structural aspects of hyperedge languages generated by hyperedge replacements, preprint Oct. 85,and L.N.C.S. vol. 247, 1987, pp. 207–219.Google Scholar
  19. [19]
    LAUTEMANN C., Decomposition trees: structured graph repre sentations and efficient algorithms, Lec. Notes Comp. Sci. 299, pp. 28–39, 1988.Google Scholar
  20. [20]
    LAUTEMANN C., Efficient algorithms on context-free graph languages, Proc. ICALP' 88, Lec. Notes Comp. Sci. 317 pp. 362–378, 1988.Google Scholar
  21. [21]
    LENGAUER T., WANKE E., Efficient analysis of graph properties on context-free graph languages, Proc. ICALP 1988, Lec. Notes Comp. Sci. 317, pp. 379–393.Google Scholar
  22. [22]
    MEZEI J., WRIGHT J., Algebraic automata and context-free sets, Information and Control 11 (1967) 3–29.Google Scholar
  23. [23]
    MONIEN B., SUDBOROUGH H., Bandwidth constrained NP complete problems, 13th ACM Symp. on Theory of computation, 1981, pp. 207–217.Google Scholar
  24. [24]
    ROBERTSON N., SEYMOUR P., Some new results on the well quasi-ordering of graphs, Annals of Discrete Mathematics 23 (1984), 343–354, Elsevier Pub.Google Scholar
  25. [25]
    ROBERTSON N., SEYMOUR P., Graph minors V, Excluding a planar graph, J. Combinatorial Theory Ser. B, 41 (1986) 92–114.Google Scholar
  26. [26]
    ROBERTSON N., SEYMOUR P., Graph minors XVI, Wagner's conjecture, in preparation, 1988.Google Scholar
  27. [27]
    SEESE D., The structure of the models of decidable monadic theories of graphs, 1987, submitted for publication.Google Scholar
  28. [28]
    THATCHER J., WRIGHT J., Generalized finite automata theory, Math. Systems Theory 2 (1970) 57–81.Google Scholar
  29. [29]
    WAGNER K., Uber eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937) 570–590.Google Scholar
  30. [30]
    WIMER T., HEDETNIEMI S., LASKAR R., A methodology for constructing linear graph algorithms, DCS, Clemson Univ, 1985Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Bruno Courcelle
    • 1
  1. 1.Laboratoire d' InformatiqueBordeaux I UniversityTalenceFrance

Personalised recommendations