Critical node/edge detection problems on trees
From MaRDI portal
Recommendations
- Complexity of the critical node problem over trees
- The critical node problem based on connectivity index and properties of components on trees
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- A fast greedy algorithm for the critical node detection problem
Cites work
- A branch-and-price algorithm for capacitated hypergraph vertex separation
- An integer programming framework for critical elements detection in graphs
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
- Complexity and approximability of the \(k\)-way vertex cut
- Complexity of the critical node problem over trees
- Component-cardinality-constrained critical node problem in graphs
- Detecting critical nodes in sparse graphs
- Exact interdiction models and algorithms for disconnecting networks via node deletions
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Hybrid constructive heuristics for the critical node problem
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Identifying sets of key players in a social network
- On integer and bilevel formulations for the \(k\)-vertex cut problem
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Robust optimization of graph partitioning and critical node detection in analyzing networks
- The critical node detection problem in networks: a survey
Cited in
(7)- The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees
- Removing undesirable flows by edge deletion
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Domination edge lift critical trees
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- The critical node problem based on connectivity index and properties of components on trees
- Complexity of the critical node problem over trees
This page was built for publication: Critical node/edge detection problems on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6054014)
