Computing Cut-Based Hierarchical Decompositions in Almost Linear Time

DOI10.1137/1.9781611973402.17zbMath1422.68195OpenAlexW4252842032MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions ⋮ Unnamed Item ⋮ Sparse Semi-Oblivious Routing: Few Random Paths Suffice ⋮ Unnamed Item

This page was built for publication: Computing Cut-Based Hierarchical Decompositions in Almost Linear Time