Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
DOI10.1007/S00373-013-1299-7zbMATH Open1294.05095OpenAlexW1988177348MaRDI QIDQ2014726FDOQ2014726
Authors: Hans Raj Tiwary, Khaled 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
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Enumeration in graph theory (05C30)
Cites Work
- On the complexity of polytope isomorphism problems
- Lectures on Polytopes
- Primal-dual methods for vertex and facet enumeration
- The maximum numbers of faces of a convex polytope
- Generating all vertices of a polyhedron is hard
- On the hardness of computing intersection, union and Minkowski sum of polytopes
- Neighborhood hypergraphs of bipartite graphs
- The construction of self-dual projective polyhedra
- On the complexity of four polyhedral set containment problems
- How good are convex hull algorithms?
- Is Selfduality Involutory?
- Computing the face lattice of a polytope from its vertex-facet incidences
- A non-involutory selfduality
Cited In (7)
- Strongly self-dual polytopes and distance graphs in the unit sphere
- Self-Dual Polyhedral Cones and Their Slack Matrices
- Enumeration of self-dual configurations
- 𝑑-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
- Title not available (Why is that?)
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)
