DeepAI AI Chat
Log In Sign Up

Max-flow vitality in undirected unweighted planar graphs

11/04/2020
by   Giorgio Ausiello, et al.
0

We show a fast algorithm for determining the set of relevant edges in a planar undirected unweighted graph with respect to the maximum flow. This is a special case of the max flow vitality problem, that has been efficiently solved for general undirected graphs and st-planar graphs. The vitality of an edge of a graph with respect to the maximum flow between two fixed vertices s and t is defined as the reduction of the maximum flow caused by the removal of that edge. In this paper we show that the set of edges having vitality greater than zero in a planar undirected unweighted graph with n vertices, can be found in O(n log n) worst-case time and O(n) space.

READ FULL TEXT

page 1

page 2

page 3

page 4

04/22/2022

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

The vitality of an edge in a graph with respect to the maximum flow betw...
01/31/2022

Max Flow Vitality of Edges and Vertices in Undirected Planar Graphs

We study the problem of computing the vitality with respect to max flow ...
03/29/2018

A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs

We propose a fixed-parameter tractable algorithm for the Max-Cut problem...
11/29/2018

Fixed-Parameter Algorithms for the Weighted Max-Cut Problem on Embedded 1-Planar Graphs

We propose two fixed-parameter tractable algorithms for the weighted Max...
06/14/2022

The Maximum Linear Arrangement Problem for trees under projectivity and planarity

The Maximum Linear Arrangement problem (MaxLA) consists of finding a map...
12/28/2018

Fast Breadth-First Search in Still Less Space

It is shown that a breadth-first search in a directed or undirected grap...
01/23/2001

A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs

We propose a fast methodology for encoding graphs with information-theor...