Finding a simple polytope from its graph in polynomial time

DOI10.1007/s00454-008-9121-7zbMath1163.52004OpenAlexW2051898557MaRDI QIDQ1017924

Eric J. Friedman

Publication date: 13 May 2009

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-008-9121-7

zbMATH Keywords

graphpolytopepolynomial time

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Polytopality and Cartesian products of graphs, Treetopes and their graphs, On the reconstruction of polytopes, Graphs, skeleta and reconstruction of polytopes, Computing symmetry groups of polyhedra, Linear projections of the Vandermonde polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Puzzles and polytope isomorphisms
• A simple way to tell a simple polytope from its graph
• On the \(k\)-systems of a simple polytope
• Computing the face lattice of a polytope from its vertex-facet incidences
• Realization spaces of 4-polytopes are universal