Fast and simple fully-dynamic cut tree construction

DOI10.1007/978-3-642-35261-4_13MaRDI QIDQ4909526zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(7)

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

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)