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.

Fingerprint

Spanning Forest
Sparse Graphs
Integer programming
Integer Programming
Connected Components
Formulation
Electric network analysis
Minimum Spanning Tree
Vulnerability

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

@article{15c9a1fa7a1944e9bb455122e4a2eded,
title = "Integer programming formulations for minimum spanning forests and connected components in sparse graphs",
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",
author = "Neng Fan and Mehdi Golari",
year = "2014",
doi = "10.1007/978-3-319-12691-3.46",
language = "English (US)",
volume = "8881",
pages = "613--622",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

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

AU - Fan, Neng

AU - Golari, Mehdi

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

KW - Connected components

KW - Integer programming

KW - Minimum spanning forest

KW - Minimum spanning tree

KW - Network vulnerability analysis

UR - http://www.scopus.com/inward/record.url?scp=84921498294&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84921498294&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-12691-3.46

DO - 10.1007/978-3-319-12691-3.46

M3 - Article

AN - SCOPUS:84921498294

VL - 8881

SP - 613

EP - 622

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -