A Fast Greedy Algorithm for the Critical Node Detection Problem
type: Item
instance of: scholarly article
title: A Fast Greedy Algorithm for the Critical Node Detection Problem
zbMATH Open document ID: 1433.05302
DOI: 10.1007/978-3-319-12691-3_45
author: M. Ventresca
author: Dionne M. Aleman
published in: Combinatorial Optimization and Applications
publication date: 2015-09-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6480674
MaRDI profile type: Publication
full work available at URL: 978-3-319-12691-3 45
OpenAlex ID: W792477341
cites work: Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
cites work: Detecting critical nodes in sparse graphs
cites work: Inoculation strategies for victims of viruses and the sum-of-squares partition problem
cites work: Branch and cut algorithms for detecting critical nodes in undirected graphs
cites work: Complexity of the critical node problem over trees
cites work: Bound and exact methods for assessing link vulnerability in complex networks
cites work: Q2941641
cites work: Authoritative sources in a hyperlinked environment
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
cites work: A derandomized approximation algorithm for the critical node detection problem
cites work: A randomized algorithm with local search for containment of pandemic disease spread
cites work: Exact identification of critical nodes in sparse networks via new compact formulations
cites work: An integer programming framework for critical elements detection in graphs
cites work: Collective dynamics of ‘small-world’ networks
description: scientific article