Max flow vitality in general and st‐planar graphs

DOI10.1002/net.21878zbMath1418.90268arXiv1710.01965OpenAlexW2962797154MaRDI QIDQ5226589

Andrea Ribichini, Paolo Giulio Franciosa, Isabella Lari, Giorgio Ausiello

Publication date: 1 August 2019

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1710.01965

zbMATH Keywords

vitalityminimum cutplanar graphsmaximum flowgeneral graphsfault resiliency

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Non-crossing shortest paths lengths in planar graphs in linear time, How vulnerable is an undirected planar graph with respect to max flow, Non-crossing shortest paths lengths in planar graphs in linear time, How vulnerable is an undirected planar graph with respect to max flow, A dichotomy result for cyclic-order traversing games, Non-crossing shortest paths in undirected unweighted planar graphs in linear time