Critical node/edge detection problems on trees
From MaRDI portal
Publication:6054014
DOI10.1007/s10288-022-00518-0zbMath1522.90152OpenAlexW4283693029MaRDI QIDQ6054014
Syed Md Omar Faruk, Marco Di Summa
Publication date: 24 October 2023
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-022-00518-0
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Dynamic programming (90C39)
Cites Work
- Unnamed Item
- Identifying sets of key players in a social network
- Hybrid constructive heuristics for the critical node problem
- Component-cardinality-constrained critical node problem in graphs
- An integer programming framework for critical elements detection in graphs
- Complexity of the critical node problem over trees
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Detecting critical nodes in sparse graphs
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- The critical node detection problem in networks: a survey
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- A branch-and-price algorithm for capacitated hypergraph vertex separation
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
- Complexity and approximability of the k‐way vertex cut
- Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
This page was built for publication: Critical node/edge detection problems on trees
