Graph Structure and Monadic Second-Order Logic

Bruno Courcelle, Joost Engelfriet

ISBN 10: 0521898331 / ISBN 13: 9780521898331

Published by Cambridge University Press, GB, 2012

About this Item

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.

Seller Inventory # LU-9780521898331

Bibliographic Details

• Title: Graph Structure and Monadic Second-Order Logic
• Publisher: Cambridge University Press, GB
• Publication Date: 2012
• Language: English
• ISBN 10: 0521898331
• ISBN 13: 9780521898331
• Binding: Hardback
• Condition: New
• Weight: 1270 grams

About this title

Synopsis

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.

About the Author

Bruno Courcelle is a Professor at Bordeaux 1 University and a member of LaBRI (the Bordeaux Laboratory of Computer Science, CNRS) and of the Institut Universitaire de France. After studying at the École Normale Supérieure, he was a researcher at INRIA (1972–8), before becoming a Professor at Bordeaux in 1979. He obtained his PhD (supervised by M. Nivat), in 1976. He is on the editorial boards for the journals Information and Computation and Logical Methods in Computer Science.