Publication details
Algorithms for Classes of Graphs with Bounded Expansion
| Authors | |
|---|---|
| Year of publication | 2010 |
| Type | Article in Periodical |
| Magazine / Source | GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE |
| Citation | |
| Description | 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 or 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. |