Computing Cut-Based Hierarchical Decompositions in Almost Linear Time
From MaRDI portal
Publication:5383976
DOI10.1137/1.9781611973402.17zbMath1422.68195MaRDI QIDQ5383976
Hanjo Täubig, Chintan D. Shah, Harald Räcke
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973402.17
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Unnamed Item, Unnamed Item, Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions, Sparse Semi-Oblivious Routing: Few Random Paths Suffice