An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
From MaRDI portal
Publication:3549662
DOI10.1145/1250790.1250879zbMath1231.05247OpenAlexW1964773853MaRDI QIDQ3549662
Debmalya Panigrahi, Ramesh Hariharan, Telikepalli Kavitha, Anand Bhalgat
Publication date: 5 January 2009
Published in: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1250790.1250879
Related Items (13)
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ On Element-Connectivity Preserving Graph Simplification ⋮ Tight Bounds for Gomory-Hu-like Cut Counting ⋮ Mincut sensitivity data structures for the insertion of an edge ⋮ Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs ⋮ Generalized cut trees for edge-connectivity ⋮ The saga of minimum spanning trees ⋮ Mincut Sensitivity Data Structures for the Insertion of an Edge ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Parametric analysis on cut-trees and its application on a protein clustering problem ⋮ Fast Augmenting Paths by Random Sampling from Residual Graphs ⋮ Unnamed Item
This page was built for publication: An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
