Luồng cực đại
Sign in to saveAlso known as max flow, maximum-flow problem
computational problem in graph theory
In the Vinony graph
Vinony's link graph records 60 inbound references to Luồng cực đại, and connects out to push–relabel maximum flow algorithm, L. R. Ford, Jr. and Robert Tarjan.
It is catalogued under topics including Computational problems in graph theory and Network flow problem.
Vinony links it to 18 Wikipedia language editions.
Wikidata facts
- Image
- Maximum bipartite matching to max flow.svg
Sources (3)
via Wikidata · CC0
Connections
push–relabel maximum flow algorithm
Entity
L. R. Ford, Jr.
Entity
Robert Tarjan
Entity
flow network
Entity
Daniel Sleator
Entity
International Standard Book Number
Entity
baseball
Entity
integer
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
irrational number
Entity
discrete mathematics
Entity
JSTOR
Organization
bibcode
Entity
Q118398
Entity
mathematical optimization
Entity
if and only if
Entity
breadth-first search
Entity
big O notation
Entity
Q22908627
Entity