Algorithms for Classes of Graphs with Bounded Expansion

Authors:
Zdeněk Dvořák;Daniel Král'
Affiliations:
Institute for Theoretical Computer Science (ITI), Faculty of Mathematics and Physics, Charles University, Prague 1, Czech Republic 118 00;Institute for Theoretical Computer Science (ITI), Faculty of Mathematics and Physics, Charles University, Prague 1, Czech Republic 118 00
Venue:
Graph-Theoretic Concepts in Computer Science
Year:
2009

Citing 0
Cited 2

Testing first-order properties for subclasses of sparse graphs

Journal of the ACM (JACM)
A dynamic data structure for counting subgraphs in sparse graphs

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

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.