Abstract
The diameter of the graph of a d-dimensional polyhedron with n facets is at most nlog d+2.
| Original language | English |
|---|---|
| Pages (from-to) | 315-316 |
| Number of pages | 2 |
| Journal | Bulletin of the American Mathematical Society |
| Volume | 26 |
| Issue number | 2 |
| DOIs |
|
| State | Published - Apr 1992 |
Fingerprint
Dive into the research topics of 'A quasi-polynomial bound for the diameter of graphs of polyhedra'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver