An Incremental Evaluation Mechanism for the Critical Node Problem

Fang Biqing
Fang Biqing
Cai Zejie
Cai Zejie
Cited by: 0|Bibtex|Views39|Links

Abstract:

The Critical Node Problem (CNP) is to identify a subset of nodes in a graph whose removal maximally degrades pairwise connectivity. The CNP is an important variant of the Critical Node Detection Problem (CNDP) with wide applications. Due to its NP-hardness for general graphs, most works focus on local search algorithms that can return a...More

Code:

Data:

Your rating :
0

 

Tags
Comments