Finding a simple polytope from its graph in polynomial time

DOI10.1007/S00454-008-9121-7MaRDI QIDQ1017924zbMATH OpenOpenAlexFDO

Authors 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

graphpolynomial timepolytope

Mathematics Subject Classification ID

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

Recommendations

• Finding a Polytope from Its Graph in Polynomial Time
• scientific article; zbMATH DE number 1953195
• On the complexity of polytope isomorphism problems
• scientific article; zbMATH DE number 1538125
• Combinatorial face enumeration in convex polytopes

Cites work

• A simple way to tell a simple polytope from its graph
• Computing the face lattice of a polytope from its vertex-facet incidences
• scientific article; zbMATH DE number 4092241 (Why is no real title available?)
• scientific article; zbMATH DE number 1095138 (Why is no real title available?)
• scientific article; zbMATH DE number 1953195 (Why is no real title available?)
• On the \(k\)-systems of a simple polytope
• Puzzles and polytope isomorphisms
• Realization spaces of 4-polytopes are universal

Cited in

(16)

• On the \(k\)-systems of a simple polytope
• On the reconstruction of polytopes
• Computing the face lattice of a polytope from its vertex-facet incidences
• Complexity and algorithms for Euler characteristic of simplicial complexes
• Polytopality and Cartesian products of graphs
• Treetopes and their graphs
• Linear projections of the Vandermonde polynomial
• Computing symmetry groups of polyhedra
• On combinatorial properties of linear program digraphs
• scientific article; zbMATH DE number 1953195 (Why is no real title available?)
• scientific article; zbMATH DE number 1538125 (Why is no real title available?)
• scientific article; zbMATH DE number 1538126 (Why is no real title available?)
• Finding a Polytope from Its Graph in Polynomial Time
• Book review of: G. Pineda Villavicencio, Polytopes and graphs
• Subword complexes and Kalai's conjecture on reconstruction of spheres
• Graphs, skeleta and reconstruction of polytopes

This page was built for publication: Finding a simple polytope from its graph in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017924)