Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
From MaRDI portal
Publication:2014726
Recommendations
Cites work
- A non-involutory selfduality
- Computing the face lattice of a polytope from its vertex-facet incidences
- Generating all vertices of a polyhedron is hard
- How good are convex hull algorithms?
- Is Selfduality Involutory?
- Lectures on Polytopes
- Neighborhood hypergraphs of bipartite graphs
- On the complexity of four polyhedral set containment problems
- On the complexity of polytope isomorphism problems
- On the hardness of computing intersection, union and Minkowski sum of polytopes
- Primal-dual methods for vertex and facet enumeration
- The construction of self-dual projective polyhedra
- The maximum numbers of faces of a convex polytope
Cited in
(7)- Strongly self-dual polytopes and distance graphs in the unit sphere
- Enumeration of self-dual configurations
- Self-Dual Polyhedral Cones and Their Slack Matrices
- 𝑑-dimensional self-dual polytopes and Meissner polytopes
- Vertex-facet assignments for polytopes
- On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
- scientific article; zbMATH DE number 7348694 (Why is no real title available?)
This page was built for publication: Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014726)