Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Data Structures and Algorithms

arXiv:2204.10169 (cs)
[Submitted on 21 Apr 2022 (v1), last revised 3 Aug 2022 (this version, v3)]

Title:A computational study of Gomory-Hu construction tree algorithms

Authors:Vladimir Kolmogorov
View PDF
Abstract:This paper studies algorithms for computing a Gomory-Hu tree, which is a classical data structure that compactly stores all minimum $s$-$t$ cuts of an undirected weighted graph. We consider two classes of algorithms: the original method by Gomory and Hu and the method based on "OrderedCuts" that we recently proposed. We describe practical implementations of these methods, and compare them experimentally with the algorithms from the previous experimental studies by Goldberg and Tsioutsiouliklis (2001) and by Akibo et al. (2016) (designed for unweighted simple graphs). Results indicate that the method based on OrderedCuts is the most robust, and often outperforms other implementations by a large factor.
Subjects: Data Structures and Algorithms (cs.DS)
Cite as: arXiv:2204.10169 [cs.DS]
  (or arXiv:2204.10169v3 [cs.DS] for this version)
  https://doi.org/10.48550/arXiv.2204.10169

Submission history

From: Vladimir Kolmogorov [view email]
[v1] Thu, 21 Apr 2022 15:28:29 UTC (25 KB)
[v2] Tue, 26 Apr 2022 15:31:49 UTC (25 KB)
[v3] Wed, 3 Aug 2022 12:05:22 UTC (49 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.DS
< prev   |   next >
new | recent | 2022-04
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)