Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth

Authors:
Bernardetta Addis;Marco Di Summa;Andrea Grosso
Affiliations:
-;-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 12
Cited 1

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
The maximum edge biclique problem is NP-complete

Discrete Applied Mathematics
Identifying sets of key players in a social network

Computational & Mathematical Organization Theory
Efficient Spare Allocation for Reconfigurable Arrays

IEEE Design & Test
Modeling s-t path availability to support disaster vulnerability assessment of network infrastructure

Computers and Operations Research
Detecting critical nodes in sparse graphs

Computers and Operations Research
On approximation of new optimization methods for assessing network vulnerability

INFOCOM'10 Proceedings of the 29th conference on Information communications
Complexity of the critical node problem over trees

Computers and Operations Research
How to cut a graph into many pieces

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Deterministic network interdiction

Mathematical and Computer Modelling: An International Journal
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

Networks

A derandomized approximation algorithm for the critical node detection problem

Computers and Operations Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

We consider the problem of deleting a limited number of nodes from a graph in order to minimize a connectivity measure of the surviving nodes. We prove that the problem isNP-complete even on quite particular types of graphs, and define a dynamic programming recursion that solves the problem in polynomial time when the graph has bounded treewidth. We extend this polynomial algorithm to several variants of the problem.