%0 Thesis %1 phd/dnb/Hartmann14 %A Hartmann, Tanja %D 2014 %K dblp %T Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering.

@phdthesis{phd/dnb/Hartmann14, added-at = {2021-07-17T00:00:00.000+0200}, author = {Hartmann, Tanja}, biburl = {https://www.bibsonomy.org/bibtex/2158e8338285849d56f310bdff2e4c4e8/dblp}, ee = {https://d-nb.info/1064504167}, interhash = {54b8dd7e7d1be5b31c3d6d01ec9bddfd}, intrahash = {158e8338285849d56f310bdff2e4c4e8}, keywords = {dblp}, school = {Karlsruhe Institute of Technology}, timestamp = {2024-04-09T08:38:38.000+0200}, title = {Algorithms for Graph Connectivity and Cut Problems - Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering.}, year = 2014 }