Implementations of the Goldberg-Tarjan Maximum Flow Algorithm

No abstract is available for this paper.

• Publication year

  1991

• Venue

  Network Flows And Matching

• Publication date

  Unknown publication date

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1090/dimacs/012/02
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• No references are available for this paper.

• Network Flow Algorithms

  2019cites this paper
• The Partial Augment-Relabel Algorithm for the Maximum Flow Problem

  2008cites this paper
• An Auction Algorithm for the Max-Flow Problem 1 ' 2

  2005cites this paper
• Graph Clustering and Minimum Cut Trees

  2004cites this paper
• Minimum-Cost Optimization in Multicommodity Logistic Chain Network

  2004cites this paper
• Performance Analysis and Best Implementations of Old and New Algorithms for the Open-Pit Mining Problem

  2000cites this paper
• Cut tree algorithms

  1999cites this paper
• Recent Developments in Maximum Flow

  1998cites this paper
• Augment or push: a computational study of bipartite matching and unit-capacity flow algorithms

  1998cites this paper
• Recent Developments in Maximum Flow Algorithms (Invited Lecture)

  1998cites this paper
• Experimental study of minimum cut algorithms

  1997cites this paper
• Beyond the flow decomposition barrier

  1997cites this paper
• On Implementing the Push—Relabel Method for the Maximum Flow Problem

  1997influential citation
• Length Functions for Flow

  1997cites this paper
• Computational investigations of maximum flow algorithms

  1997cites this paper
• Global Price Updates Help

  1997cites this paper
• Solving unweighted and weighted bipartite matching problems in theory and practice

  1996cites this paper
• An efficient cost scaling algorithm for the assignment problem

  1995cites this paper
• An auction algorithm for the max-flow problem

  1995cites this paper
• Mathematical Equivalence of the Auction Algorithm for Assignment and the ∊-Relaxation (Preflow-Push) Method for Min Cost Flow

  1994cites this paper
• An efficient implementation of a scaling minimum-cost flow algorithm

  1993cites this paper
• Computational Investigations of Flow Algorithms by Ravindra

  year unknowncites this paper