Total unimodularity and the Euler-subgraph problem (Q1107442)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Total unimodularity and the Euler-subgraph problem |
scientific article |
Statements
Total unimodularity and the Euler-subgraph problem (English)
0 references
1988
0 references
The author gives a survey (including proofs) of all known characterizations by way of forbidden structures of totally unimodular matrices. Furthermore he considers a new type of combinatorial optimization problems, the Euler-subgraph problem, suggested by a topological characterization of totally unimodular matrices.
0 references
convex polyhedra
0 references
survey
0 references
characterizations
0 references
totally unimodular matrices
0 references
Euler-subgraph problem
0 references
