Shortest Augmenting Paths for Online Matchings on Trees

Abstract

The shortest augmenting path (Sap) algorithm is one of the most classical approaches to the maximum matching and maximum flow problems, e.g., using it Edmonds and Karp (J. ACM 19(2), 248–264 1972) have shown the first strongly polynomial time algorithm for the maximum flow problem. Quite astonishingly, although it has been studied for many years already… (More)
DOI: 10.1007/s00224-017-9838-x

Topics

  • Presentations referencing similar topics