An Overview of Graph Covering and Partitioning

Please always quote using this URN: urn:nbn:de:0297-zib-79431
  • While graph covering is a fundamental and well-studied problem, this field lacks a broad and unified literature review. The holistic overview of graph covering given in this article attempts to close this gap. The focus lies on a characterization and classification of the different problems discussed in the literature. In addition, notable results and common approaches are also included. Whenever appropriate, our review extends to the corresponding partioning problems.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Stephan SchwartzORCiD
Document Type:ZIB-Report
Tag:Graph Covering; Graph Partitioning
MSC-Classification:05-XX COMBINATORICS (For finite fields, see 11Txx)
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
CCS-Classification:A. General Literature
Date of first Publication:2020/08/27
Series (Serial Number):ZIB-Report (20-24)
ISSN:1438-0064