Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

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

مسئله بیشینه جریان · Vinony

🌐فارسی

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

EntityQ2585642· pop 18· linked from 60 articles

مسئله بیشینه جریان

Also known as max flow, maximum-flow problem

computational problem in graph theory

Wikidata facts

Image: Maximum bipartite matching to max flow.svg

Sources (3)

wikidata.org
docs.openalex.org
web.archive.org

via Wikidata · CC0

Available in 18 languages

Français
Deutsch
中文
日本語
Русский
Português
Italiano
العربية
Catalan
Hungarian

Connections

push–relabel maximum flow algorithm

L. R. Ford, Jr.

Categories

Computational problems in graph theory Network flow problem

Sources

wikipedia.externallinksexternallink

via Wikidata sitelinks · CC0

Robert Tarjan

Entity

International Standard Book Number

digital object identifier

International Standard Serial Number

irrational number

discrete mathematics

mathematical optimization

breadth-first search

Sign in to save

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