作者: Ashwin Arulselvan , Clayton W. Commander , Lily Elefteriadou , Panos M. Pardalos
DOI: 10.1016/J.COR.2008.08.016
关键词: Combinatorial optimization 、 Connectivity 、 Critical graph 、 Linear programming 、 Dense graph 、 Integer programming 、 Commercial software 、 Mathematics 、 Mathematical optimization 、 Heuristics
摘要: Identifying critical nodes in a graph is important to understand the structural characteristics and connectivity properties of network. In this paper, we focus on detecting nodes, or whose deletion results minimum pair-wise among remaining nodes. This problem, known as node problem has applications several fields including biomedicine, telecommunications, military strategic planning. We show that recognition version NP-complete derive mathematical formulation based integer linear programming. addition, propose heuristic for which exploits combinatorial structure graph. The then enhanced by application local improvement method. A computational study presented apply programming real randomly generated data sets. For all instances tested, able efficiently provide optimal solutions fraction time required commercial software package.