Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

maximum flow problem · Vinony

EntityQ2585642· pop 18· linked from 60 articles

maximum flow problem

Sign in to save

computational problem in graph theory

Connections

push–relabel maximum flow algorithm

L. R. Ford, Jr.

International Standard Book Number

digital object identifier

International Standard Serial Number

irrational number

discrete mathematics

mathematical optimization

breadth-first search

Categories

Computational problems in graph theory Network flow problem

Sources

wikipedia.externallinksexternallink

What links here60 pages

widest path problem

Dinic's algorithm

minimum-cost flow problem

Hopcroft–Karp algorithm

Max-flow min-cut theorem

k-vertex-connected graph

D. R. Fulkerson

2-satisfiability

Karger's algorithm

Stoer–Wagner algorithm

Richard M. Karp

push–relabel maximum flow algorithm

unimodular matrix

k-edge-connected graph

parallel random-access machine

Ford–Fulkerson algorithm

L. R. Ford, Jr.

minimum spanning tree

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

minimum-cost flow problem

Entitydist 0.29

Hamiltonian path problem

Entitydist 0.35

Flow Shop Scheduling Problem

Entitydist 0.40

extremal graph theory

Entitydist 0.43

Entitydist 0.45

blossom algorithm

Entitydist 0.48

route inspection problem

Entitydist 0.50

Barnette's conjecture

Entitydist 0.50

control-flow graph

Entitydist 0.53

Dijkstra's algorithm

Entitydist 0.54

geometric programming

Entitydist 0.55

graph toughness

Entitydist 0.55