Network flow interdiction on planar graphs
DOI10.1016/J.DAM.2010.04.008zbMATH Open1209.05117OpenAlexW2144824278MaRDI QIDQ987697FDOQ987697
Publication date: 13 August 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.04.008
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Flows in graphs (05C21) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximal Flow Through a Network
- Clustering and domination in perfect graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Deterministic network interdiction
- Removing Arcs from a Network
- Stochastic network interdiction
- Reformulation and sampling to solve a stochastic network interdiction problem
- Finding the n Most Vital Links in Flow Networks
- Flow in Planar Graphs with Multiple Sources and Sinks
- Optimal interdiction policy for a flow network
- Optimal interdiction of a supply network
- The network inhibition problem
- Network flow interdiction on planar graphs
- Flow in planar graphs with vertex capacities
Cited In (30)
- Minimum cost edge blocker clique problem
- Using edge contractions to reduce the semitotal domination number
- Determining the most vital arcs on the shortest path for fire trucks in terrorist actions that will cause fire
- Multilevel Approaches for the Critical Node Problem
- Vertex downgrading to minimize connectivity
- Exact algorithms for the minimum cost vertex blocker clique problem
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm
- On the hardness of covering-interdiction problems
- Connectivity interdiction
- A mixed-integer programming approach for locating jamming devices in a flow-jamming attack
- Interdicting facilities in tree networks
- Maximum Capacity Path Interdiction Problem with Fixed Costs
- Bounds of spectral radii on edge-most outer-planar bipartite graphs
- Matching interdiction
- Network flow interdiction on planar graphs
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Interdiction problems on planar graphs
- Perfect matching interdiction problem restricted to a stable vertex
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives
- The critical node game
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance
- Minimum \(d\)-transversals of maximum-weight stable sets in trees
- On designing networks resilient to clique blockers
- Network flows and non-guillotine cutting patterns
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance
- The complexity of blocking (semi)total dominating sets with edge contractions
- Vertex control of flows in networks
- Hardness and approximation for network flow interdiction
- Title not available (Why is that?)
- A study of network violator interception based on a reliable game model
This page was built for publication: Network flow interdiction on planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987697)
