Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles
From MaRDI portal
Publication:5167815
DOI10.1007/978-3-662-43948-7_88zbMath1412.68091arXiv1407.6869OpenAlexW1647896934MaRDI QIDQ5167815
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.6869
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (1)
This page was built for publication: Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles
