Advertisement
Published in:
2008 | OriginalPaper | Chapter
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
Author : Bruno Courcelle
Published in: Automata, Languages and Programming
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Graph structure
is 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 Logic
are 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.