Login / Signup

Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search.

Andrew V. GoldbergSagi HedHaim KaplanPushmeet KohliRobert Endre TarjanRenato F. Werneck
Published in: ESA (2015)
Keyphrases
  • maximum flow
  • breadth first search
  • depth first search
  • minimum cut
  • directed graph
  • search algorithm
  • memory efficient
  • push relabel