Maximum st-Flow in Directed Planar Graphs via Shortest Paths

DOI10.1007/978-3-642-45278-9_36zbMath1408.05067arXiv1305.5823OpenAlexW2962854250MaRDI QIDQ2870049

Glencora Borradaile, Anna Harutyunyan

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Flows in graphs (05C21)

Related Items (1)

Faster shortest paths in dense distance graphs, with applications

This page was built for publication: Maximum st-Flow in Directed Planar Graphs via Shortest Paths