Push–relabel maximum flow algorithm

Use the mouse wheel or two fingers (on touchscreens) to zoom in and out of the map.

Export map as:

Research this topic

Explore the main themes, entities and connections around Push–relabel maximum flow algorithm. Start with the topic map, then use the sections below for research and deeper semantic analysis.

Explore this topic

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

History

Alexander V. Karzanov Andrew V. Goldberg Robert Tarjan Journal of the ACM Uzi Vishkin

5 related topics

Practical implementations

Linked list Amortized complexity Breadth-first search

3 related topics

The generic push–relabel algorithm

Max-flow min-cut theorem Potential argument

2 related topics

Sample implementations

Python R {base}

2 related topics

Topics to explore

Browse the full topic structure. Each item opens a new analysis centered on that subject.

Overview

Mathematical optimization
Maximum flows Maximum flow
Flow network
Ford–Fulkerson algorithm
Strongly polynomial
Edmonds–Karp algorithm
Dynamic trees Link-cut tree
Minimum cost flows Minimum cost flow
FIFO FIFO (computing and electronics)
Topologically sorted Topological sorting

History

The generic push–relabel algorithm

Max-flow min-cut theorem
Potential argument Potential method

Practical implementations

Sample implementations

Python Python (programming language)
R {base} R (programming language)

Advanced semantic analysis

Deeper signals for content research, entity SEO and topical coverage. The plain-language headings explain what each technical view is useful for.

Map overview Semantic statistics