Efficient methods for the distance-based critical node detection problem in complex networks

Glory Uche Alozie; Ashwin Arulselvan; Kerem Akartunalı; Eduardo L. Pasiliao

doi:10.1016/j.cor.2021.105254

ScienceGate Book Chapters

JOURNAL ARTICLE

Efficient methods for the distance-based critical node detection problem in complex networks

Glory Uche Alozie Ashwin Arulselvan Kerem Akartunalı Eduardo L. Pasiliao

Year: 2021 Journal: Computers & Operations Research Vol: 131 Pages: 105254-105254 Publisher: Elsevier BV

DOI: 10.1016/j.cor.2021.105254

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Node (physics) Metric (unit) Heuristic Scalability Integer programming Survivability Mathematical optimization Exploit Column generation Set (abstract data type) Algorithm Mathematics Artificial intelligence

Metrics

Cited By

2.72

FWCI (Field Weighted Citation Impact)

Refs

0.90

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Complex Network Analysis Techniques

Physical Sciences → Physics and Astronomy → Statistical and Nonlinear Physics

Infrastructure Resilience and Vulnerability Analysis

Physical Sciences → Engineering → Civil and Structural Engineering

Graph theory and applications

Physical Sciences → Mathematics → Geometry and Topology

Efficient methods for the distance-based critical node detection problem in complex networks

Metrics

Citation History

Topics

Related Documents

Efficient methods for the distance-based critical node detection problem in complex networks

Efficient Benders decomposition for distance-based critical node detection problem

A heuristic approach for the distance-based critical node detection problem in complex networks

The distance-based critical node detection problem : models and algorithms

Critical node detection problem for complex network in undirected weighted networks