DeepAI AI Chat
Log In Sign Up

A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs

by   Giorgio Ausiello, et al.
Sapienza University of Rome

The vitality of an edge in a graph with respect to the maximum flow between two fixed vertices s and t is defined as the reduction of the maximum flow value caused by the removal of that edge. The max-flow vitality problem has already been efficiently solved for st-planar graphs but has remained open for general planar graphs. For the first time our result provides an optimal solution for general planar graphs although restricted to the case of unweighted planar graphs.


page 1

page 2

page 3

page 4


Max-flow vitality in undirected unweighted planar graphs

We show a fast algorithm for determining the set of relevant edges in a ...

Min-Cost Flow in Unit-Capacity Planar Graphs

In this paper we give an O((nm)^2/3 C) time algorithm for computing min-...

A Compositional Approach to Network Algorithms

We present elements of a typing theory for flow networks, where "types",...

A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks

We present an alternative and simpler method for computing principal typ...

A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks

We pull together previously established graph-theoretical results to pro...

Recognizing and Embedding Simple Optimal 2-Planar Graphs

In the area of beyond-planar graphs, i.e. graphs that can be drawn with ...

A Potential Reduction Inspired Algorithm for Exact Max Flow in Almost O(m^4/3) Time

We present an algorithm for computing s-t maximum flows in directed grap...