Maximum Flows by Incremental Breadth-First Search

DOI10.1007/978-3-642-23719-5_39zbMath1346.68220OpenAlexW1754904414MaRDI QIDQ3092252

Haim Kaplan, Andrew V. Goldberg, Renato F. Werneck, Sagi Hed, Robert Endre Tarjan

Publication date: 16 September 2011

Published in: Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_39

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Machine vision and scene understanding (68T45) Flows in graphs (05C21)

Related Items

Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm, Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search, An exact combinatorial algorithm for minimum graph bisection, Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program, Network Flow-Based Refinement for Multilevel Hypergraph Partitioning