The enumeration of vertex induced subgraphs with respect to the number of components
European Journal of Combinatorics
F-rank-width of (edge-colored) graphs
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Fly-automata, their properties and applications
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Automata for monadic second-order model-checking
RP'11 Proceedings of the 5th international conference on Reachability problems
The complexity of two graph orientation problems
Discrete Applied Mathematics
On the model-checking of monadic second-order formulas with edge set quantifications
Discrete Applied Mathematics
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Where First-Order and Monadic Second-Order Logic Coincide
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Walk logic as a framework for path query languages on graph databases
Proceedings of the 16th International Conference on Database Theory
Flag & check: data access with monadically defined queries
Proceedings of the 32nd symposium on Principles of database systems
Lower bounds on the complexity of MSO1 model-checking
Journal of Computer and System Sciences
Clique-width and edge contraction
Information Processing Letters
From Monadic Second-Order Definable String Transformations to Transducers
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Quantitative Monadic Second-Order Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |
The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The author not only provides a thorough description of the theory, but also details its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory.