Pseudoforest Partitions and the Approximation of Connected Subgraphs of High Density

Blumenstock, Markus Andreas Daniel2020-01-132020-01-132020https://openscience.ub.uni-mainz.de/handle/20.500.12030/3598engInC-1.0https://rightsstatements.org/vocab/InC/1.0/004 Informatik004 Data processingPseudoforest Partitions and the Approximation of Connected Subgraphs of High DensityDissertationurn:nbn:de:hebis:77-diss-1000032480xi, 261 Seiten