scientific article; zbMATH DE number 6297711
From MaRDI portal
Publication:5417628
zbMath1288.05053MaRDI QIDQ5417628
Erik D. Demaine, Ken-ichi Kawarabayashi, Mohammad Taghi Hajiaghayi
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Characterising bounded expansion by neighbourhood complexity ⋮ Approximation algorithms via contraction decomposition ⋮ Subexponential parameterized algorithms ⋮ Partitioning \(H\)-minor free graphs into three subgraphs with no large components ⋮ Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs ⋮ Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
This page was built for publication: