On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism

DOI10.1145/1377676.1377707zbMATH Open1221.68097OpenAlexW2135482255MaRDI QIDQ3602912FDOQ3602912

Authors: Hans Raj Tiwary, Khaled Elbassioni 

Publication date: 12 February 2009

Published in: Proceedings of the twenty-fourth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1377676.1377707

Recommendations

• Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
• On the complexity of polytope isomorphism problems
• Primal-dual methods for vertex and facet enumeration
• Self-polar polytopes
• A non-involutory selfduality

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects related to convexity (52B55)

This page was built for publication: On the complexity of checking 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 Q3602912)