Short Cycles via Low-Diameter Decompositions

DOI10.1137/1.9781611975482.161zbMath1432.68360arXiv1810.05143OpenAlexW2952477043MaRDI QIDQ5236351

No author found.

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.05143

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions

This page was built for publication: Short Cycles via Low-Diameter Decompositions