How vulnerable is an undirected planar graph with respect to max flow
From MaRDI portal
Publication:6196897
DOI10.1002/NET.22205OpenAlexW4390586026MaRDI QIDQ6196897FDOQ6196897
Authors: Lorenzo Balzotti, Paolo G. Franciosa 
Publication date: 15 March 2024
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.22205
Cites Work
- Maximal Flow Through a Network
- Planar maps as labeled mobiles
- Quantum Geometry
- A Census of Planar Maps
- Max flows in \(O(nm)\) time, or better
- Network Analysis
- A linear-time algorithm for a special case of disjoint set union
- Deterministic network interdiction
- A Faster Deterministic Maximum Flow Algorithm
- Finding the n Most Vital Links in Flow Networks
- Title not available (Why is that?)
- The maximum flow network interdiction problem: valid inequalities, integrality gaps, and approximability
- Faster shortest-path algorithms for planar graphs
- Optimal interdiction of a supply network
- The network inhibition problem
- Multiple-source shortest paths in planar graphs
- Min-cuts and shortest cycles in planar graphs in \(O(n \log\log n)\) time
- An \(O(n\log n)\) algorithm for maximum \(st\)-flow in a directed planar graph
- Maximum Flow in Planar Networks
- Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
- Improved algorithms for min cut and max flow in undirected planar graphs
- Title not available (Why is that?)
- Short path queries in planar graphs in constant time
- Random planar graphs and the London street network
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time
- Max flow vitality in general and \(st\)-planar graphs
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Non-crossing shortest paths lengths in planar graphs in linear time
This page was built for publication: How vulnerable is an undirected planar graph with respect to max flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196897)
