Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems (Q1324027)
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: Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems |
scientific article; zbMATH DE number 584226
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems |
scientific article; zbMATH DE number 584226 |
Statements
Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems (English)
0 references
24 July 1994
0 references
polynomial-time algorithms
0 references
polyhedra with exponential graph density
0 references
systems of linear constraints
0 references
0.9422203
0 references
0 references
0 references
