Max-flow vitality in undirected unweighted planar graphs
Giorgio Ausiello,
Paolo G. Franciosa,
Isabella Lari
et al.
Abstract: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 h… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.