Finding a simple polytope from its graph in polynomial time
From MaRDI portal
Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)
Recommendations
Cites work
- 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?)
- A simple way to tell a simple polytope from its graph
- Computing the face lattice of a polytope from its vertex-facet incidences
- On the \(k\)-systems of a simple polytope
- Puzzles and polytope isomorphisms
- Realization spaces of 4-polytopes are universal
Cited in
(14)- Graphs, skeleta and reconstruction of polytopes
- Linear projections of the Vandermonde polynomial
- Treetopes and their graphs
- On combinatorial properties of linear program digraphs
- scientific article; zbMATH DE number 1538125 (Why is no real title available?)
- scientific article; zbMATH DE number 1538126 (Why is no real title available?)
- Complexity and algorithms for Euler characteristic of simplicial complexes
- Finding a Polytope from Its Graph in Polynomial Time
- Computing symmetry groups of polyhedra
- Polytopality and Cartesian products of graphs
- scientific article; zbMATH DE number 1953195 (Why is no real title available?)
- Computing the face lattice of a polytope from its vertex-facet incidences
- On the reconstruction of polytopes
- On the \(k\)-systems of a simple polytope
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)
