Opening book details…
Can I read From Polynomial Time Queries to Graph Structure Theory on EtoBox?
From Polynomial Time Queries to Graph Structure Theory by Martin Grohe is a Computer Science article available to read on EtoBox.
What is From Polynomial Time Queries to Graph Structure Theory about?
We give a logical characterization of the polynomial-time properties of graphs with excluded minors: For every class __C__ of graphs such that some graph __H__ is not a minor of any graph in __C__ , a property __P__ of graphs in __C__ is decidable in polynomial time if and only if it is definable in fixed-point logic with counting. Furthermore, we prove that for every class __C__ of graphs with excluded minors there is a __k__ such that a simple combinatorial algorithm, namely "the __k__ -dimensional Weisfeiler--Lehman algorithm," decides isomorphism of graphs in __C__ in polynomial time.
Who reads From Polynomial Time Queries to Graph Structure Theory?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Martin Grohe
- Publisher
- Association for Computing Machinery; Association for Computing Machinery (ACM); ScienceOpen (ISSN 0001-0782)
- Published
- 2011
- Language
- EN
- Field
- Computer Science (Physical Sciences)