Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
type: Item
instance of: scholarly article
title: Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
zbMATH Open document ID: 1294.05095
author: Hans Raj Tiwary
author: Khaled Elbassioni
published in: Graphs and Combinatorics
publication date: 2014-06-16T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C60
zbMATH DE Number: 6304682
zbMATH Keywords: self-duality
zbMATH Keywords: polytopes
zbMATH Keywords: vertex enumeration
zbMATH Keywords: graph isomorphism
MaRDI profile type: Publication
full work available at URL: s00373-013-1299-7
OpenAlex ID: W1988177348
cites work: The construction of self-dual projective polyhedra
cites work: How good are convex hull algorithms?
cites work: Neighborhood hypergraphs of bipartite graphs
cites work: Primal-dual methods for vertex and facet enumeration
cites work: Generating all vertices of a polyhedron is hard
cites work: On the complexity of four polyhedral set containment problems
cites work: A non-involutory selfduality
cites work: Is Selfduality Involutory?
cites work: Computing the face lattice of a polytope from its vertex-facet incidences
cites work: On the complexity of polytope isomorphism problems
cites work: The maximum numbers of faces of a convex polytope
cites work: On the hardness of computing intersection, union and Minkowski sum of polytopes
cites work: Lectures on Polytopes
DOI: 10.1007/S00373-013-1299-7
description: scientific article; zbMATH DE number 6304682