A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs
Data Structures and Algorithms
2022-04-25 v1
Abstract
The vitality of an edge in a graph with respect to the maximum flow between two fixed vertices and 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 -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.
Cite
@article{arxiv.2204.10568,
title = {A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs},
author = {Giorgio Ausiello and Lorenzo Balzotti and Paolo G. Franciosa and Isabella Lari and Andrea Ribichini},
journal= {arXiv preprint arXiv:2204.10568},
year = {2022}
}
Comments
11 pages, 5 figures. arXiv admin note: text overlap with arXiv:2011.02375