Graph Structure and Monadic Second-Order Logic
A Language-Theoretic Approach
Nonfiction, Science & Nature, Mathematics, Discrete Mathematics, Logic
| Author: | Bruno Courcelle, Joost Engelfriet | ISBN: | 9781139637862 |
| Publisher: | Cambridge University Press | Publication: | June 14, 2012 |
| Imprint: | Cambridge University Press | Language: | English |
| Author: | Bruno Courcelle, Joost Engelfriet |
| ISBN: | 9781139637862 |
| Publisher: | Cambridge University Press |
| Publication: | June 14, 2012 |
| Imprint: | Cambridge University Press |
| Language: | English |
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 authors not only provide a thorough description of the theory, but also detail 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.
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 authors not only provide a thorough description of the theory, but also detail 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.
