Skip to main content

1 Result(s)

within Sagi Hed Remove this filter Computer Graphics Remove this filter Discrete Mathematics in Computer Science Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Maximum Flows by Incremental Breadth-First Search

    Maximum flow and minimum s-t cut algorithms are used to solve several fundamental problems in computer vision. These problems have special structure, and standard techniques perform worse than the special-purpose...

    Andrew V. Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan… in Algorithms – ESA 2011 (2011)