On the complexity of recognizing a class of generalized networks (Q1058995)
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 3902427
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of recognizing a class of generalized networks |
scientific article; zbMATH DE number 3902427 |
Statements
On the complexity of recognizing a class of generalized networks (English)
0 references
1985
0 references
The problem of determining whether a given linear programming problem can be converted to a generalized network flow problem having no unit-weight cycles is shown to be NP-hard. The same argument also shows that the problem of determining whether a gain matroid is bicircular is NP-hard.
0 references
problem transformation
0 references
problem equivalence
0 references
computational complexity
0 references
generalized network flow problem
0 references
unit-weight cycles
0 references
matroid
0 references
0.7980054020881653
0 references
0.7892638444900513
0 references
0.7877699136734009
0 references
0.7651636600494385
0 references
