Abstract
The diameter of the graph of a d-dimensional polyhedron with n facets is at most nlog d+2. © 1992, American Mathematical Society.
Cite
CITATION STYLE
APA
Kalai, G., & Kleitman, D. J. (1992). A quasi-polynomial bound for the diameter of graphs of polyhedra. Bulletin of the American Mathematical Society. https://doi.org/10.1090/S0273-0979-1992-00285-9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free