Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
From MaRDI portal
Publication:5494960
DOI10.1109/FOCS.2011.15zbMath1292.68129arXiv1107.1292OpenAlexW2089807138MaRDI QIDQ5494960
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.1292
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Approximation algorithms (68W25)
Related Items (6)
Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension ⋮ Grid minors in damaged grids ⋮ Ultrametric subsets with large Hausdorff dimension ⋮ Approximating small balanced vertex separators in almost linear time ⋮ Cops, Robbers, and Threatening Skeletons: Padded Decomposition for Minor-Free Graphs ⋮ Short and Simple Cycle Separators in Planar Graphs
This page was built for publication: Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
