Cut tree algorithms: An experimental study

DOI10.1006/JAGM.2000.1136MaRDI QIDQ2709792zbMATH OpenOpenAlexFDO

Authors Andrew V. Goldberg, Kostas Tsioutsiouliklis

Publication date 17 April 2001

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2000.1136

zbMATH Keywords

cut tree problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1305427
• Efficient algorithms for generalized cut‐trees
• scientific article; zbMATH DE number 177540
• Practical performance of efficient minimum cut algorithms
• Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions

Cited in

(8)

• Practical performance of efficient minimum cut algorithms
• On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms
• Parametric analysis on cut-trees and its application on a protein clustering problem
• scientific article; zbMATH DE number 1305427 (Why is no real title available?)
• Counterexamples for Directed and Node Capacitated Cut-Trees
• New algorithms and lower bounds for all-pairs max-flow in undirected graphs
• A revisited branch-and-cut algorithm for large-scale orienteering problems
• Approximate Gomory-Hu tree is faster than \(n-1\) maximum flows

This page was built for publication: Cut tree algorithms: An experimental study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2709792)