Skip to content
EntityQ1412924· pop 21· linked from 275 articles

luồng trên mạng

Sign in to save

directed graph where each edge has a capacity and each edge receives a flow

In the Vinony graph

Vinony's link graph records 275 inbound references to luồng trên mạng, and connects out to matching, Edmonds–Karp algorithm and ecology.

It is catalogued under the topic Network flow problem.

Vinony links it to 21 Wikipedia language editions.

Wikidata facts

Subclass of
weighted graph
Image
Simpe flow network.svg
Show 5 more facts
ACM Classification Code (2012)
10003644
studied by
graph theory
topic's main category
Category:Network flow problem
Commons category
Flow networks
maintained by WikiProject
WikiProject Mathematics
Sources (2)

via Wikidata · CC0

Connections

Categories