Total unimodularity and the Euler-subgraph problem (Q1107442)
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 4064767
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total unimodularity and the Euler-subgraph problem |
scientific article; zbMATH DE number 4064767 |
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
0.7885106205940247
0 references
0.7782984375953674
0 references
0.7752225995063782
0 references
0.7727041840553284
0 references
