Home > Term: maximum-flow problem
maximum-flow problem
The problem of finding the maximum flow between any two vertices of a directed graph.
- Jenis Kata: noun
- Industri / Domain: Sains komputer
- Kategori: Algorithms & data structures
- Government Agency: NIST
0
Penulis
- GeorgeV
-
(Gold) 1123 poin - 100% positive feedback
