Finding a Polytope from Its Graph in Polynomial Time

Authors:
Eric J. Friedman
Affiliations:
School of Operations Research and Information Engineering, Cornell University,
Venue:
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Year:
2007

Citing 5
Cited 0

A simple way to tell a simple polytope from its graph

Journal of Combinatorial Theory Series A
Computing the face lattice of a polytope from its vertex-facet incidences

Computational Geometry: Theory and Applications
Unique Sink Orientations of Cubes

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Reconstructing a simple polytope from its graph

Combinatorial optimization - Eureka, you shrink!
Unique sink orientations of grids

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that one can compute a (simple) polytope from its graph in Polynomial time. This computation of a polytope from its graph was shown to be solvable by Blind and Mani and more recently Kalai provided a simple proof that leads to an exponential time algorithm. Our proof relies on a Primal-Dual characterization by Joswig, Kaibel and Korner. We describe an exponential Linear Programming which can be used to construct the solution and show that it can be solved in polynomial time.