A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
From MaRDI portal
Publication:2329655
Recommendations
- Component-cardinality-constrained critical node problem in graphs
- 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
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Detecting critical nodes in sparse graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A faster algorithm for betweenness centrality*
- A preliminary analysis of the distance based critical node problem
- A randomized algorithm with local search for containment of pandemic disease spread
- An integer programming framework for critical elements detection in graphs
- Automata, Languages and Programming
- Bipartite permutation graphs
- Branch and cut algorithms for detecting critical nodes in undirected graphs
- Cardinality-Constrained Critical Node Detection 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
- Disconnecting graphs by removing vertices: a polyhedral approach
- Exact identification of critical nodes in sparse networks via new compact formulations
- 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
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Linear structure of bipartite permutation graphs and the longest path problem
- Node-and edge-deletion NP-complete problems
- Parameterized complexity of critical node cuts
- 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
- Random generation and enumeration of bipartite permutation graphs
- The critical node detection problem in networks: a survey
- The vertex separator problem: a polyhedral investigation
Cited in
(11)- EIA-CNDP: an exact iterative algorithm for critical node detection problem
- Component-cardinality-constrained critical node problem in graphs
- Complexity of the multilevel critical node problem
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem
- Modeling the spread of infectious diseases through influence maximization
- A linear time algorithm for finding all hinge vertices of a permutation graph
- scientific article; zbMATH DE number 1796979 (Why is no real title available?)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
- Acyclically pushable bipartite permutation digraphs: an algorithm
- The connected critical node problem
- A New Algorithm for Finding a Pseudoperipheral Node in a Graph
This page was built for publication: A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329655)
