Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
type: Item
instance of: scholarly article
title: Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
zbMATH Open document ID: 1401.05089
author: Roberto Aringhieri
author: Andrea Grosso
author: Pierre Hosteins
author: Rosario Scatamacchia
published in: Discrete Applied Mathematics
publication date: 2018-12-18T00:00:00Z
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 6994886
zbMATH Keywords: critical node problem
zbMATH Keywords: connectivity measure
zbMATH Keywords: shortest paths
zbMATH Keywords: dynamic programming
zbMATH Keywords: polynomial time algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2017.12.035
OpenAlex ID: W2792628671
cites work: Hybrid constructive heuristics for the critical node problem
cites work: Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
cites work: A genetic algorithm for a class of critical node problems
cites work: VNS solutions for the critical node problem
cites work: A preliminary analysis of the distance based critical node problem
cites work: Detecting critical nodes in sparse graphs
cites work: Cardinality-Constrained Critical Node Detection Problem
cites work: Identifying sets of key players in a social network
cites work: Stochastic network interdiction
cites work: Efficiency of scale-free networks: Error and attack tolerance
cites work: Complexity of the critical node problem over trees
cites work: On some counting polynomials in chemistry
cites work: Component-cardinality-constrained critical node problem in graphs
cites work: Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
cites work: The Structure and Function of Complex Networks
cites work: Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
cites work: Exact interdiction models and algorithms for disconnecting networks via node deletions
cites work: Linear-time computability of combinatorial problems on series-parallel graphs
cites work: The Recognition of Series Parallel Digraphs
cites work: Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
cites work: An integer programming framework for critical elements detection in graphs
cites work: Removing Arcs from a Network
cites work: Deterministic network interdiction
cites work: Epidemic dynamics on complex networks
DOI: 10.1016/J.DAM.2017.12.035
description: scientific article; zbMATH DE number 6994886