Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem-Reference-Cited by-同舟云学术

Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem

Published:2019-01 Issue: Volume:253 Page:103-121
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Aringhieri Roberto^ORCID,Grosso Andrea,Hosteins Pierre,Scatamacchia Rosario

Funder

ERDF —European Regional Development Fund

National Funds

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference45 articles.

1. Hybrid constructive heuristics for the critical node problem;Addis;Ann. Oper. Res.,2016

2. Removing critical nodes from a graph: complexity results and polynomial algorithms for the case of bounded treewidth;Addis;Discrete Appl. Math.,2013

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

4. D. Alevras, M. Grötschel, R. Wessäly, Capacity and survivability models for telecommunication networks, Technical report, in: Proceedings of EURO/INFORMS Meeting, 1997.

5. A genetic algorithm for a class of critical node problems;Aringhieri,2016

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

1. Optimal design of vaccination policies: A case study for Newfoundland and Labrador;Operations Research Letters;2024-07

2. A fast tri-individual memetic search approach for the distance-based critical node problem;European Journal of Operational Research;2023-07

3. Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations;Mathematical Programming Computation;2022-11-07

4. Complexity of the multilevel critical node problem;Journal of Computer and System Sciences;2022-08

5. Critical node/edge detection problems on trees;4OR;2022-06-29