Generalization of the Ford-Fulkerson theorem to multigraphs (Q2563400)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 957057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalization of the Ford-Fulkerson theorem to multigraphs |
scientific article; zbMATH DE number 957057 |
Statements
Generalization of the Ford-Fulkerson theorem to multigraphs (English)
0 references
11 December 1996
0 references
A multigraph with one source and one sink is considered. Then the Ford-Fulkerson theorem is extended to the multigraph case. This theorem allows us to consider a multigraph as a graph with different flow capacity of the arcs.
0 references
multigraph
0 references
maximal flow
0 references
network
0 references
0.7847093939781189
0 references
0.7567382454872131
0 references
0.7517383694648743
0 references
