Media type: E-Book; Thesis Title: Algorithms for Graph Connectivity and Cut Problems : Connectivity Augmentation, All-Pairs Minimum Cut, and Cut-Based Clustering Contributor: Hartmann, Tanja [Author] imprint: 2014 Extent: Online-Ressource Language: English Identifier: Keywords: Hochschulschrift Origination: University thesis: Karlsruhe, KIT, Diss., 2014 Footnote: Access State: Open Access