The structure of bases in bicircular matroids (Q912110)
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 4143997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The structure of bases in bicircular matroids |
scientific article; zbMATH DE number 4143997 |
Statements
The structure of bases in bicircular matroids (English)
0 references
1989
0 references
A generalized network flow problem (GNF) is a linear program with at most two nonzero entries in the constraint matrix; not exactly two, like in the pure network flow problem (PNF). Due to its special structure, even the former can be performed much faster than the general linear programming problems. A ``hidden'' PNF in an LP problem can be recognized [see, for example, \textit{R. E. Bixby} and \textit{W. Cunningham}, Converting linear programs to network problems, Math. Oper. Res. 5, 322-357 (1980; Zbl 0442.90095)]. The present paper and some forthcoming ones give a recognition algorithm for GNF under some condition.
0 references
generalized network flow problem
0 references
GNF
0 references
pure network flow problem
0 references
PNF
0 references
recognition algorithm
0 references
0 references
0 references
0.9679116
0 references
0.9379757
0 references
0.92612976
0 references
0.91209894
0 references
0.9119954
0 references
0.9018671
0 references
