@inbook{11847,
  abstract     = {This paper serves as a user guide to the Vienna graph clustering framework. We review our general memetic algorithm, VieClus, to tackle the graph clustering problem. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. After giving a description of the algorithms employed, we establish the connection of the graph clustering problem to protein–protein interaction networks and moreover give a description on how the software can be used, what file formats are expected, and how this can be used to find functional groups in protein–protein interaction networks.},
  author       = {Biedermann, Sonja and Henzinger, Monika H and Schulz, Christian and Schuster, Bernhard},
  booktitle    = {Protein-Protein Interaction Networks},
  editor       = {Canzar, Stefan and Rojas Ringeling, Francisca},
  isbn         = {9781493998722},
  issn         = {1940-6029},
  pages        = {215–231},
  publisher    = {Springer Nature},
  title        = {{Vienna Graph Clustering}},
  doi          = {10.1007/978-1-4939-9873-9_16},
  volume       = {2074},
  year         = {2019},
}