Algorithms for Classes of Graphs with Bounded Expansion

DOI10.1007/978-3-642-11409-0_2zbMath1273.05218DBLPconf/wg/DvorakK09OpenAlexW1684832175WikidataQ57601404 ScholiaQ57601404MaRDI QIDQ5851090

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

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_2

zbMATH Keywords

sparse graphsbounded tree-widthalgorithmic resultsgraphs with bounded expansionlocally bounded tree-widthlocally excluding a minornowhere-dense graphsproper minor-closed classes of graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Confronting intractability via parameters ⋮ A distributed low tree-depth decomposition algorithm for bounded expansion classes

This page was built for publication: Algorithms for Classes of Graphs with Bounded Expansion