Bound and exact methods for assessing link vulnerability in complex networks

T. N. Dinh (), M. T. Thai () and H. T. Nguyen ()
Additional contact information
T. N. Dinh: Virginia Commonwealth University
M. T. Thai: University of Florida
H. T. Nguyen: Ton Duc Thang University

Journal of Combinatorial Optimization, 2014, vol. 28, issue 1, No 2, 3-24

Abstract: Abstract Assessing network systems for failures is critical to mitigate the risk and develop proactive responses. In this paper, we investigate devastating consequences of link failures in networks. We propose an exact algorithm and a spectral lower-bound on the minimum number of removed links to incur a significant level of disruption. Our exact solution can identify optimal solutions in both uniform and weighted networks through solving a well-constructed mixed integer program. Also, our spectral lower-bound derives from the Laplacian eigenvalues an estimation on the vulnerability of large networks that are intractable for exact methods. Through experiments on both synthetic and real-world networks, we demonstrate the efficiency of the proposed methods.

Keywords: Vulnerability assessment; Pairwise connectivity; Integer programming; Spectral bound (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9742-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:28:y:2014:i:1:d:10.1007_s10878-014-9742-0

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-014-9742-0

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().