Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
type: Item
instance of: scholarly article
title: Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
zbMATH Open document ID: 1433.68302
author: Charles Maske
author: Jaime Cohen
author: Elias P. Duarte
published in: Algorithmica
publication date: 2020-04-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7189177
zbMATH Keywords: cut trees
zbMATH Keywords: parallel algorithms
zbMATH Keywords: Gomory-Hu algorithm
zbMATH Keywords: graph contractions
describes a project that uses: Pajek
describes a project that uses: Pajek datasets
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: s00453-019-00658-6
OpenAlex ID: W2996205869
cites work: Algorithmic Aspects of Graph Connectivity
cites work: Cut Problems in Graphs with a Budget Constraint
cites work: Finding k Cuts within Twice the Optimal
cites work: Multi-Terminal Network Flows
cites work: Very Simple Methods for All Pairs Network Flow Analysis
cites work: Collective dynamics of ‘small-world’ networks
cites work: Q3043782
cites work: Random graphs.
cites work: Statistical mechanics of complex networks
cites work: Implementing an efficient minimum capacity cut algorithm
cites work: Q5501810
cites work: Q4252310
cites work: Planar Graph Perfect Matching Is in NC
cites work: New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs
Wikidata QID: Q126588996
DOI: 10.1007/S00453-019-00658-6
description: scientific article; zbMATH DE number 7189177