Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth-Reference-Cited by-同舟云学术

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

Published:2013-11 Issue:16-17 Volume:161 Page:2349-2360
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Addis Bernardetta,Di Summa Marco,Grosso Andrea

Funder

DFG

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference25 articles.

1. B. Addis, M. Di Summa, A. Grosso, Removing critical nodes from a graph: complexity results and polynomial algorithms for the case of bounded treewidth, Optimization online (www.optmization-online.org), 2011.

2. Error and attack tolerance of complex networks;Albert;Nature,2000

3. Complexity of finding embeddings in a k-tree;Arnborg;SIAM Journal on Algebraic and Discrete Methods,1987

4. Detecting critical nodes in sparse graphs;Arulselvan;Computers & Operations Research,2009

5. Cardinality-constrained critical node detection problem;Arulselvan,2011

Cited by 61 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Network Vulnerability Assessment Using Critical Nodes Identification;2023 International Symposium on Networks, Computers and Communications (ISNCC);2023-10-23

2. Min–max optimization of node‐targeted attacks in service networks;Networks;2023-10-10

3. Identifying the cardinality-constrained critical nodes with a hybrid evolutionary algorithm;Information Sciences;2023-09

4. Applications, challenges, and solutions to single- and multi-objective critical node detection problems: a survey;The Journal of Supercomputing;2023-06-05

5. An integer programming model for controlling dengue transmission;International Journal of Computing Science and Mathematics;2023