scholarly journals The stochastic critical node problem over trees

Networks ◽  
2020 ◽  
Vol 76 (3) ◽  
pp. 381-401
Author(s):  
Pierre Hosteins ◽  
Rosario Scatamacchia
Keyword(s):  
Critical Node ◽  
Critical Node Problem ◽  
Node Problem

scholarly journals An Algorithm for Critical Nodes Problem in Social Networks Based on Owen Value

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Xue-Guang Wang
Keyword(s):  
Social Networks ◽  
Community Structure ◽  
Marginal Contribution ◽  
Actual Situation ◽  
Owen Value ◽  
Critical Node ◽  
Critical Nodes ◽  
Synthetic Datasets ◽  
Critical Node Problem ◽  
Node Problem

Discovering critical nodes in social networks has many important applications. For finding out the critical nodes and considering the widespread community structure in social networks, we obtain each node’s marginal contribution by Owen value. And then we can give a method for the solution of the critical node problem. We validate the feasibility and effectiveness of our method on two synthetic datasets and six real datasets. At the same time, the result obtained by using our method to analyze the terrorist network is in line with the actual situation.

VNS solutions for the Critical Node Problem

2015 ◽  
Vol 47 ◽  
pp. 37-44 ◽  
Author(s):  
Roberto Aringhieri ◽  
Andrea Grosso ◽  
Pierre Hosteins ◽  
Rosario Scatamacchia
Keyword(s):  
Critical Node ◽  
Critical Node Problem ◽  
Node Problem

scholarly journals Complexity of the critical node problem over trees

2011 ◽  
Vol 38 (12) ◽  
pp. 1766-1774 ◽  
Author(s):  
Marco Di Summa ◽  
Andrea Grosso ◽  
Marco Locatelli
Keyword(s):  
Critical Node ◽  
Critical Node Problem ◽  
Node Problem

An optimal approach for the critical node problem using semidefinite programming

2017 ◽  
Vol 471 ◽  
pp. 315-324 ◽  
Author(s):  
Cheng Jiang ◽  
Zhonghua Liu ◽  
Juyun Wang ◽  
Hua Yu ◽  
Xiaoling Guo
Keyword(s):  
Semidefinite Programming ◽  
Critical Node ◽  
Optimal Approach ◽  
Critical Node Problem ◽  
Node Problem

A preliminary analysis of the Distance Based Critical Node Problem

2016 ◽  
Vol 55 ◽  
pp. 25-28 ◽  
Author(s):  
Roberto Aringhieri ◽  
Andrea Grosso ◽  
Pierre Hosteins ◽  
Rosario Scatamacchia
Keyword(s):  
Preliminary Analysis ◽  
Critical Node ◽  
Critical Node Problem ◽  
Node Problem

The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees

2020 ◽  
pp. 2050041
Author(s):  
Xiucui Guan ◽  
Chao Liu ◽  
Qiao Zhang
Keyword(s):  
Upper Bound ◽  
Connectivity Index ◽  
Component Size ◽  
Number Of Components ◽  
Critical Node ◽  
Residual Graph ◽  
Number Formula ◽  
The One ◽  
Critical Node Problem ◽  
Node Problem

We deal with the critical node problem (CNP) in a graph [Formula: see text], in which a given number [Formula: see text] of nodes are removed to minimize the connectivity of the residual graph in some sense. Several ways to minimize some connectivity measurement have been proposed, including minimizing the connectivity index(MinCI), maximizing the number of components, minimizing the maximal component size. We propose two classes of CNPs by combining the above measurements together. The objective is to minimize the sum of connectivity indexes and the total degrees in the residual graph. The CNP with an upper-bound [Formula: see text] on the maximal component size is denoted by MSCID-CS and the one with an extra upper-bound [Formula: see text] on the number of components is denoted by MSCID-CSN. They are generalizations of the MinCI, which has been shown NP-hard for general graphs. In particular, we study the case where [Formula: see text] is a tree. Two dynamic programming algorithms are proposed to solve the two classes of CNPs. The time complexities of the algorithms for MSCID-CS and MSCID-CSN are [Formula: see text] and [Formula: see text], respectively, where [Formula: see text] is the number of nodes in [Formula: see text]. Computational experiments are presented which show the effectiveness of the algorithms.

scholarly journals Local search metaheuristics for the critical node problem

Networks ◽  
2016 ◽  
Vol 67 (3) ◽  
pp. 209-221 ◽  
Author(s):  
Roberto Aringhieri ◽  
Andrea Grosso ◽  
Pierre Hosteins ◽  
Rosario Scatamacchia
Keyword(s):  
Local Search ◽  
Critical Node ◽  
Critical Node Problem ◽  
Node Problem

scholarly journals Variable Population Memetic Search: A Case Study on the Critical Node Problem

2020 ◽  
pp. 1-1
Author(s):  
Yangming Zhou ◽  
Jin-Kao Hao ◽  
Zhang-Hua Fu ◽  
Zhe Wang ◽  
Xiangjing Lai
Keyword(s):  
Critical Node ◽  
Variable Population ◽  
Critical Node Problem ◽  
Node Problem
Sign in / Sign up

Export Citation Format

Share Document