On the complexity of circulations (Q3740229)
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 3974288
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of circulations |
scientific article; zbMATH DE number 3974288 |
Statements
On the complexity of circulations (English)
0 references
1986
0 references
polynomial-time algorithm
0 references
feasible real-valued circulation
0 references
undirected graphs
0 references
mixed graphs
0 references
NP-complete
0 references
0 references
0 references
0.82000786
0 references
0.8172615
0 references
0 references
0 references
0.81284136
0 references
