Optimization Online


Efficient heuristic algorithm for identifying critical nodes in planar networks

Dalaijargal Purevusren(dalaijargal***at***gmail.com)
Gang Cui(cg***at***hit.edu.cn)

Abstract: This paper presents a new method for identifying critical nodes in planar networks. We propose an efficient method to evaluate the quality of solutions by using special properties of planar networks. It enables us to develop a computationally efficient heuristic algorithm for the problem. The proposed algorithm assisted on randomly generated planar networks. The experimental results are reported.

Keywords: Critical node detection, Planar networks, Heuristics, NP-complete, Combinatorial optimization

Category 1: Combinatorial Optimization

Category 2: Network Optimization

Citation: 1, Harbin Institute of Technology, 07/2018

Download: [PDF]

Entry Submitted: 07/25/2018
Entry Accepted: 08/24/2018
Entry Last Modified: 07/25/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society