Fast and simple fully-dynamic cut tree construction

DOI10.1007/978-3-642-35261-4_13zbMATH Open1260.90158OpenAlexW58614044MaRDI QIDQ4909526FDOQ4909526

Authors: Tanja Hartmann, Dorothea Wagner 

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://publikationen.bibliothek.kit.edu/1000030004/2292501

Recommendations

• Fully-dynamic min-cut
• Efficient algorithms for generalized cut‐trees
• Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
• Fully-dynamic MIN-cut
• Dynamic Graph Clustering Using Minimum-Cut Trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (6)

• Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
• Partial inverse min-max spanning tree problem
• Mincut Sensitivity Data Structures for the Insertion of an Edge
• Mincut sensitivity data structures for the insertion of an edge
• Practical fully dynamic minimum cut algorithms
• Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs

This page was built for publication: Fast and simple fully-dynamic cut tree construction

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