Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism

DOI10.1007/s00373-013-1299-7zbMath1294.05095OpenAlexW1988177348MaRDI QIDQ2014726

Hans Raj Tiwary, Khaled M. Elbassioni

Publication date: 16 June 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1299-7

zbMATH Keywords

polytopesself-dualitygraph isomorphismvertex enumeration

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Self-Dual Polyhedral Cones and Their Slack Matrices, Vertex-facet assignments for polytopes, 𝑑-dimensional self-dual polytopes and Meissner polytopes

Cites Work

• On the hardness of computing intersection, union and Minkowski sum of polytopes
• A non-involutory selfduality
• Primal-dual methods for vertex and facet enumeration
• The construction of self-dual projective polyhedra
• How good are convex hull algorithms?
• On the complexity of polytope isomorphism problems
• Computing the face lattice of a polytope from its vertex-facet incidences
• On the complexity of four polyhedral set containment problems
• Is Selfduality Involutory?
• Lectures on Polytopes
• Neighborhood hypergraphs of bipartite graphs
• The maximum numbers of faces of a convex polytope
• Generating all vertices of a polyhedron is hard