Improved sparse covers for graphs excluding a fixed minor
From MaRDI portal
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- Covering cycles in sparse graphs
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- scientific article; zbMATH DE number 2044921
- Bounded clique cover of some sparse graphs
- Complete Minors in Graphs Without Sparse Cuts
- scientific article; zbMATH DE number 1003278
- scientific article; zbMATH DE number 1508265
- Sparse obstructions for minor-covering parameters
- scientific article; zbMATH DE number 822142
Cited in
(9)- Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs
- Faster approximate diameter and distance oracles in planar graphs
- Sparse obstructions for minor-covering parameters
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- Oblivious buy-at-bulk in planar graphs
- scientific article; zbMATH DE number 7236428 (Why is no real title available?)
- Space-efficient path-reporting approximate distance oracles
- Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs
- Strong-diameter decompositions of minor free graphs
This page was built for publication: Improved sparse covers for graphs excluding a fixed minor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401394)
