Integer programming formulations for minimum spanning forests and connected components in sparse graphs

Neng Fan, Mehdi Golari

Research output: Contribution to journalArticle

Abstract

In this paper, we first review several integer programming formulations for the minimum spanning tree problem, and then adapt these formulations for solving the minimum spanning forest problem in sparse graphs. Some properties for the spanning forest and connected components are studied, and then we present the integer programming formulation for finding the largest connected component, which has been widely used for network vulnerability analysis.

Keywords

  • Connected components
  • Integer programming
  • Minimum spanning forest
  • Minimum spanning tree
  • Network vulnerability analysis

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Integer programming formulations for minimum spanning forests and connected components in sparse graphs'. Together they form a unique fingerprint.

  • Cite this