An Incremental Evaluation Mechanism for the Critical Node Problem
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 good quality solution in a reasonable time. However, computing the objective function of CNP is a frequent procedure and is time-consuming (with complexity O(|V | + |E|)) during the search, which is a common problem that previous algorithms suffered from. In this paper, we propose a general incremental evaluation mechanism (IEM) to compute the objective function with much lower complexity. In this work, we improved two important greedy operations with IEM, along with experiments. Finally, we evaluate IEM by applying it into an evolutionary algorithm on two popular benchmarks, compared with the state-of-the-art approach. The experimental results showed the significance of IEM.
Cite
@article{arxiv.1908.11846,
title = {An Incremental Evaluation Mechanism for the Critical Node Problem},
author = {Biqing Fang and Hai Wan and Shaowei Cai and Zejie Cai},
journal= {arXiv preprint arXiv:1908.11846},
year = {2019}
}
Comments
There are some typos in our experiments, we need about a month to fix it