Algorithms for classes of graphs with bounded expansion

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5911 LNCS, Issue , 2010, Pages 17-32

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

^a CHARLES UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED CLASS; DENSE GRAPHS; META-THEOREMS; SPARSE GRAPHS; TREE-WIDTH;

COMPUTER SCIENCE;

GRAPH THEORY;

EID: 72249117619     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11409-0_2     Document Type: Conference Paper

References (31)

1. Arnborg, S., Proskurowski, A., Corneil, D.G.: Forbidden minors characterization of partial 3-trees. Discrete Math. 80, 1-19 (1990)
2. Bodlaender, H.L., Deogun, J.S., Jansen, K., Kloks, T., Kratsch, D., Müller, H., Tuza, Z.: Ranking of graphs. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 292-304. Springer, Heidelberg (1995)
3. Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating treewidth, pathwidth, frontsize and shortest elimination tree. J. Algorithms 25, 1305-1317 (1996)
4. Brodal, G.S., Fagelberg, R.: Dynamic representations of sparse graphs. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 342-351. Springer, Heidelberg (1999)
5. Courcelle, B.: The monadic second-order logic of graph I. Recognizable sets of finite graphs. Inform. and Comput. 85, 12-75 (1990)
6. Dawar, A., Grohe, M., Kreutzer, S.: Locally excluding a minor. In: Proc. LICS 2007, pp. 270-279. IEEE Computer Society Press, Los Alamitos (2007)
7. DeVos, M., Ding, G., Oporowski, B., Sanders, D.P., Reed, B., Seymour, P.D., Vertigan, D.: Excluding any graph as a minor allows a low tree-width 2-coloring. J. Combin. Theory Ser. B 91, 25-41 (2004)
8. Dvořák, Z.: Assymptotical structure of combinatorial objects, PhD thesis, Charles University (2007)
9. Dvořák, Z., Král', D., Thomas, R.: Deciding first order properties for nowhere dense graphs (manuscript) (2009)
10. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. In: Proc. SODA 1995, pp. 632-640. ACM&SIAM (1995)
11. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3, 1-27 (1999)
12. Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27, 275-291 (2000)
13. Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 331-340. Springer, Heidelberg (1999)
14. Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. J. ACM 48, 1184-1206 (2001)
15. Gaifman, H.: On local and non-local properties. In: Proc. Herbrand Symp. Logic Colloq. North-Holland, Amsterdam (1982)
16. Kowalik, L.: Adjacency queries in dynamic sparse graphs. Inf. Process. Lett. 102, 191-195 (2007)
17. Kowalik, L., Kurowski, M.: Oracles for bounded-length shortest paths in planar graphs. ACM Trans. Algorithms 2, 335-363 (2006)
18. Kowalik, L., Kurowski, M.: Short path queries in planar graphs in constant time. In: Proc. STOC 2003, pp. 143-148 (2003)
19. Nešetřil, J., Ossona de Mendéz, P.: First order properties of nowhere dense structures (manuscript) (2008)
20. Nešetřil, J., Ossona de Mendéz, P.: Grad and classes with bounded expansion I. Decompositions. European J. Combin. 29, 760-776 (2008)
21. Nešetřil, J., Ossona de Mendéz, P.: Grad and classes with bounded expansion II. Algorithmic aspects. European J. Combin. 29, 777-791 (2008)
22. Nešetřil, J., Ossona de Mendéz, P.: Grad and classes with bounded expansion III. Restricted graph homomorphism dualities. European J. Combin. 29, 1012-1024 (2008)
23. Nešetřil, J., Ossona de Mendéz, P.: Linear time low tree-width partitions and algorithmic consequences. In: Proc. STOC 2006, pp. 391-400 (2006)
24. Nešetřil, J., Ossona de Mendéz, P.: On nowhere dense graphs (manuscript) (2008)
25. Nešetřil, J., Ossona de Mendéz, P.: Structural properties of sparse graphs (manuscript) (2008)
26. Nešetřil, J., Ossona de Mendéz, P.: Tree depth, subgraph coloring and homomorphism bounds. European J. Combin. 27, 1022-1041 (2006)
27. Nešetřil, J., Ossona de Mendéz, P., Wood, D.: Characterizations and examples of graph classes with bounded expansion (manuscript) (2008)
28. Peleg, D.: Distance-dependent distributed directories. Info. Computa. 103, 270-298 (1993)
29. Robertson, N., Seymour, P.D.: Graph minors V: Excluding a planar graph. J. Combin. Theory Ser. B 41, 92-114 (1986)
30. Robertson, N., Seymour, P.D.: Graph Minors XX.Wagner's conjecture. J. Combin. Theory Ser. B 92, 325-357 (2004)
31. Seese, D.: Linear time computable problems and first-order descriptions. Math. Structu. Comput. Sci. 6, 505-526 (1996)