Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
type: Item
instance of: scholarly article
title: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
zbMATH Open document ID: 1251.90342
author: M. Ventresca
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C80
zbMATH DE Number: 6106630
zbMATH Keywords: critical node detection
zbMATH Keywords: complex networks
zbMATH Keywords: random graph
zbMATH Keywords: simulated annealing
zbMATH Keywords: population-based incremental learning
describes a project that uses: Stony Brook
MaRDI profile type: Publication
full work available at URL: j.cor.2012.02.008
OpenAlex ID: W2050675408
cites work: Detecting critical nodes in sparse graphs
cites work: Efficient immunization strategies on complex networks
cites work: Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
cites work: Cardinality-Constrained Critical Node Detection Problem
cites work: Complexity of the critical node problem over trees
cites work: Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
cites work: Branch and cut algorithms for detecting critical nodes in undirected graphs
cites work: Emergence of Scaling in Random Networks
cites work: Q3267900
cites work: Collective dynamics of ‘small-world’ networks
cites work: Q3651735
cites work: Q4198056
cites work: Handbook of Applied Algorithms
cites work: Parallel Processing and Applied Mathematics
cites work: A calculus for the random generation of labelled combinatorial structures
cites work: Ranking and unranking permutations in linear time
cites work: Q4657494
cites work: Q3499247
cites work: Q2769922
cites work: Optimization by Simulated Annealing
cites work: A comparison of simulated annealing cooling strategies
cites work: A random graph model for massive graphs
cites work: Evolution of the social network of scientific collaborations
cites work: Q4792127
DOI: 10.1016/J.COR.2012.02.008
description: scientific article; zbMATH DE number 6106630