Deciding first-order properties for sparse graphs

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 133-142

  Dvořák, Zdeněk ^a   Král', Daniel ^a   Thomas, Robin ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithmic metatheorems; Graphs with bounded degree; Graphs with bounded expansion; Graphs with locally bounded tree width; Minor closed classes of graphs

Indexed keywords

CLUSTERING ALGORITHMS; DATA STRUCTURES; EXPANSION; FORESTRY; FORMAL LOGIC; GRAPH ALGORITHMS; GRAPHIC METHODS; STRUCTURAL PROPERTIES;

ALGORITHMIC METATHEOREMS; BOUNDED DEGREE; CLOSED CLASS; DYNAMIC DATA STRUCTURE; EXISTENTIAL PROPERTIES; LINEAR-TIME ALGORITHMS; RELATIONAL STRUCTURES; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 78751497840     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.20     Document Type: Conference Paper

References (28)

1. B. Courcelle, The monadic second-order logic of graph I. Recognizable sets of finite graphs, Inform. and Comput. 85 (1990), 12-75.
2. A. Dawar, M. Grohe and S. Kreutzer, Locally excluding a minor, in: Proc. LICS'07, IEEE Computer Society Press, 270-279.
3. A. Dawar and S. Kreutzer, Parameterized Complexity of First-Order Logic, Electronic Colloquium on Computational Complexity, TR09-131 (2009).
4. Z. Dvořák, K. Kawarabayashi and R. Thomas, Three-coloring triangle-free planar graphs in linear time, in: Proc. SODA'09, ACM&SIAM, 2009, 1176-1182.
5. Z. Dvořák and D. Král', Algorithms for classes of graphs with bounded expansion, in: Proc. WG'09, LNCS vol. 5911, Springer, 2009, 17-32.
6. Z. Dvořák, D. Král' and R. Thomas, Coloring triangle-free graphs on surfaces, in: Proc. SODA'09, ACM&SIAM, 2009, 120-129.
7. Z. Dvořák, D. Král' and R. Thomas, Three-coloring triangle-free graphs on surfaces VI. A linear-time algorithm, in preparation.
8. D. Eppstein, Subgraph isomorphism in planar graphs and related problems, in: Proc. SODA'95, ACM&SIAM, 632-640.
9. D. Eppstein, Subgraph isomorphism in planar graphs and related problems, J. Graph Algorithms Appl. 3 (1999), 1-27.
10. D. Eppstein, Diameter and treewidth in minor-closed graph families, Algorithmica 27 (2000), 275-291.
11. M. Frick and M. Grohe, Deciding first-order properties of locally tree-decomposable structures, J. ACM 48 (2001), 1184-1206.
12. H. Gaifman, On local and non-local properties, in: Proc. Herbrands Symp. Logic Coloq., North-Holland, 1982.
13. M. Garey, D. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
14. H. Grötzsch, Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel, Wiss. Z. Martin-Luther-Universität, Halle, Wittenberg, Math.-Nat. Reihe 8 (1959), 109-120.
15. L. Kowalik and M. Kurowski, Short path queries in planar graphs in constant time, in: Proc. STOC'03, 143-148.
16. L. Kowalik, Fast 3-coloring triangle-free planar graphs, in: Proc. ESA'04, LNCS vol. 3221, Springer, 2004, 436-447.
17. L. Kowalik and M. Kurowski, Oracles for bounded length shortest paths in planar graphs, ACM Trans. Algorithms 2 (2006), 335-363.
18. S. Kreutzer, Algorithmic meta-theorems, to appear in a workshop volume for a workshop held in Durham 2006 as part of the Newton institute special programme on Logic and Algorithms. An extended abstract appeared in: Proc. IWPEC'08, LNCS vol. 5018, Springer, 2008, 10-12.
19. S. Kreutzer, private communication, July 2010.
20. J. Nešetřil and P. Ossona de Mendez, Linear time low tree-width partitions and algorithmic consequences, in: Proc. STOC'06, 391-400.
21. J. Nešetřil and P. Ossona de Mendez, Grad and classes with bounded expansion I. Decompositions., Eur. J. Comb. 29 (2008), 760-776.
22. J. Nešetřil and P. Ossona de Mendez, Grad and classes with bounded expansion II. Algorithmic aspects., Eur. J. Comb. 29 (2008), 777-791.
23. J. Nešetřil and P. Ossona de Mendez, Grad and classes with bounded expansion III. Restricted graph homomorphism dualities., Eur. J. Comb. 29 (2008), 1012-1024.
24. J. Nešetřil and P. Ossona de Mendéz, On nowhere dense graphs, manuscript, 2008.
25. J. Nešetřil, P. Ossona de Mendez and D. Wood, Characterisations and Examples of Graph Classes with Bounded Expansion, preprint (arXiv:0902.3265v2).
26. J. Nešetřil and P. Ossona de Mendez, Structural properties of sparse graphs, in: M. Grötschel, G. O. H. Katona (eds.): Building Bridges Between Mathematics and Computer Science, Bolyai Society Mathematical Studies vol. 19, Springer, 2008.
27. N. Roberson and P. D. Seymour, Graph minors. XIII: the disjoint paths problem, J. Combin. Theory Ser. B 63 (1995), 65-110.
28. D. Wood, On the maximum number of cliques in a graph, Graphs Combin. 23 (2007), 337-352.