Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen (Q1141591): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:22, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen |
scientific article |
Statements
Ein graphentheoretischer Algorithmus für einige Flußprobleme in Netzwerken mit Kantengewinnen (English)
0 references
1976
0 references
finite directed networks
0 references
graph-theoretic algorithm
0 references
maximal flows
0 references
capacity matrix
0 references
shortest routes
0 references
negative cycles
0 references
antisymmetric network
0 references
weakly connected network
0 references
capacitated networks with gains
0 references
edge gains
0 references
path gains
0 references
gain matrix
0 references
