Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Search

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

Max-flow min-cut theorem · Vinony

🌐English

English Deutsch Français Italiano Nederlands Português Svenska Tiếng Việt Русский العربية فارسی 한국어 中文日本語

EntityQ608294· pop 19· linked from 45 articles

Max-flow min-cut theorem

theorem in optimization theory

Connections

linear programming

maximum flow problem

Categories

Combinatorial optimization Network flow problem Theorems in graph theory

Sources

wikipedia.externallinksexternallink

Menger's theorem

Entity

computer science

International Standard Book Number

digital object identifier

electrical circuit

mathematical optimization

George Bernard Dantzig

Princeton University Press

image segmentation

Mathematical Reviews

Ford–Fulkerson algorithm

Christos Papadimitriou

glossary of graph theory terms

Edmonds–Karp algorithm

Sign in to save

What links here45 pages

graph connectivity measure

glossary of graph theory terms

George Bernard Dantzig

Fulkerson Prize

König's theorem

Edmonds–Karp algorithm

Menger's theorem

Karger's algorithm

Active contour model

maximum flow problem

Hall's marriage theorem

push–relabel maximum flow algorithm

unimodular matrix

k-edge-connected graph

Ford–Fulkerson algorithm

L. R. Ford, Jr.

dual linear program

Linear network coding

Similar entities

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

second-order cone programming

Entitydist 0.55

minimum total potential energy principle

Entitydist 0.59

principle of minimum energy

Entitydist 0.59

Gauss-Wantzel theorem

Entitydist 0.62

Wallace–Bolyai–Gerwien theorem

Entitydist 0.62

Norton's theorem

Entitydist 0.62

Myhill–Nerode theorem

Entitydist 0.64

Entitydist 0.64

Entitydist 0.65

Gronwall's inequality

Entitydist 0.66

Entitydist 0.66

Entitydist 0.66