On polyhedron graph density in problems of combinatorial optimization (Q1326866)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On polyhedron graph density in problems of combinatorial optimization |
scientific article; zbMATH DE number 589597
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On polyhedron graph density in problems of combinatorial optimization |
scientific article; zbMATH DE number 589597 |
Statements
On polyhedron graph density in problems of combinatorial optimization (English)
0 references
13 July 1994
0 references
This paper deals with graphs of polyhedra associated to combinatorial problems such as shortest path, separation into triangles and three- dimensional combination. The exact value of the polyhedron graph density is obtained for the shortest path problem, whereas the exponential character of the graph density is proved for the problem of three- dimensional combination.
0 references
graphs of polyhedra
0 references
shortest path
0 references
separation into triangles
0 references
three- dimensional combination
0 references
polyhedron graph density
0 references
