Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Descriptive Complexity, Canonisation, and Definable Graph Structure Theory

$155.00 (C)

Part of Lecture Notes in Logic

  • Date Published: September 2017
  • availability: In stock
  • format: Hardback
  • isbn: 9781107014527

$ 155.00 (C)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • Contains original results which use methods from finite model theory to show the interaction between graph theory and computational complexity
    • Includes a wealth of new results, not previously published
    • Provides a reference for future research in this area
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: September 2017
    • format: Hardback
    • isbn: 9781107014527
    • length: 554 pages
    • dimensions: 235 x 160 x 36 mm
    • weight: 0.88kg
    • contains: 60 b/w illus.
    • availability: In stock
  • Table of Contents

    1. Introduction
    Part I. The Basic Theory:
    2. Background from graph theory and logic
    3. Descriptive complexity
    4. Treelike decompositions
    5. Definable decompositions
    6. Graphs of bounded tree width
    7. Ordered treelike decompositions
    8. 3-Connected components
    9. Graphs embeddable in a surface
    Part II. Definable Decompositions of Graphs with Excluded Minors:
    10. Quasi-4-connected components
    11. K5-minor free graphs
    12. Completions of pre-decompositions
    13. Almost planar graphs
    14. Almost planar completions
    15. Almost embeddable graphs
    16. Decompositions of almost embeddable graphs
    17. Graphs with excluded minors
    18. Bits and pieces
    Appendix. Robertson and Seymour's version of the local structure theorem
    References
    Symbol index
    Index.

  • Author

    Martin Grohe, RWTH Aachen University, Germany
    Martin Grohe is a Professor of Theoretical Computer Science at RTWH Aachen University, Germany, where he holds the Chair for Logic and the Theory of Discrete Systems. His research interests are in theoretical computer science interpreted broadly, including logic, algorithms and complexity, graph theory, and database theory.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×