10% off all books and free delivery over £40
Buy from our bookstore and 25% of the cover price will be given to a school of your choice to buy more books. *15% of eBooks.

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

View All Editions

The selected edition of this book is not available to buy right now.
Add To Wishlist
Write A Review

About

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory Synopsis

Descriptive complexity theory establishes a connection between the computational complexity of algorithmic problems (the computational resources required to solve the problems) and their descriptive complexity (the language resources required to describe the problems). This groundbreaking book approaches descriptive complexity from the angle of modern structural graph theory, specifically graph minor theory. It develops a 'definable structure theory' concerned with the logical definability of graph theoretic concepts such as tree decompositions and embeddings. The first part starts with an introduction to the background, from logic, complexity, and graph theory, and develops the theory up to first applications in descriptive complexity theory and graph isomorphism testing. It may serve as the basis for a graduate-level course. The second part is more advanced and mainly devoted to the proof of a single, previously unpublished theorem: properties of graphs with excluded minors are decidable in polynomial time if, and only if, they are definable in fixed-point logic with counting.

About This Edition

ISBN: 9781107014527
Publication date: 17th August 2017
Author: Martin (RWTH Aachen University, Germany) Grohe
Publisher: Cambridge University Press
Format: Hardback
Pagination: 554 pages
Series: Lecture Notes in Logic
Genres: Combinatorics and graph theory
Discrete mathematics
Mathematical logic
Algorithms and data structures