Abstract
We overview algorithmic results for classes of sparse graphs emphasizing new developments in this area. We focus on recently introduced classes of graphs with bounded expansion and nowhere-dense graphs and relate algorithmic meta-theorems for these classes of graphs to their analogues for proper minor-closed classes of graphs, classes of graphs with bounded tree-width, locally bounded tree-width and locally excluding a minor. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Dvořák, Z., & Král’, D. (2010). Algorithms for classes of graphs with bounded expansion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5911 LNCS, pp. 17–32). https://doi.org/10.1007/978-3-642-11409-0_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
