A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
From MaRDI portal
Publication:2329655
DOI10.1007/s11590-018-1371-6zbMath1429.90062OpenAlexW2905339563WikidataQ128758713 ScholiaQ128758713MaRDI QIDQ2329655
Hamamache Kheddouci, Mohammed Lalou
Publication date: 18 October 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-018-1371-6
dynamic programminggraph connectivitycritical nodesgraph separatorsbipartite permutation graphscomplete bipartite decomposition
Related Items (5)
Complexity of the multilevel critical node problem ⋮ Modeling the spread of infectious diseases through influence maximization ⋮ The connected critical node problem ⋮ Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items ⋮ EIA-CNDP: an exact iterative algorithm for critical node detection problem
Cites Work
- Unnamed Item
- Component-cardinality-constrained critical node problem in graphs
- A randomized algorithm with local search for containment of pandemic disease spread
- An integer programming framework for critical elements detection in graphs
- Random generation and enumeration of bipartite permutation graphs
- A preliminary analysis of the distance based critical node problem
- Parameterized complexity of critical node cuts
- Complexity of the critical node problem over trees
- Detecting critical nodes in sparse graphs
- Bipartite permutation 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
- Linear structure of bipartite permutation graphs and the longest path problem
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth
- Exact identification of critical nodes in sparse networks via new compact formulations
- The vertex separator problem: a polyhedral investigation
- A faster algorithm for betweenness centrality*
- Cardinality-Constrained Critical Node Detection Problem
- 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
- Node-and edge-deletion NP-complete problems
- Disconnecting graphs by removing vertices: a polyhedral approach
- Automata, Languages and Programming
This page was built for publication: A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
