Fast and Simple Fully-Dynamic Cut Tree Construction
From MaRDI portal
Publication:4909526
DOI10.1007/978-3-642-35261-4_13zbMath1260.90158OpenAlexW58614044MaRDI QIDQ4909526
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
Related Items (4)
Partial inverse min-max spanning tree problem ⋮ 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 ⋮ Mincut Sensitivity Data Structures for the Insertion of an Edge
This page was built for publication: Fast and Simple Fully-Dynamic Cut Tree Construction