Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The construction of self-dual projective polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are convex hull algorithms? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood hypergraphs of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual methods for vertex and facet enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all vertices of a polyhedron is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of four polyhedral set containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-involutory selfduality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is Selfduality Involutory? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the face lattice of a polytope from its vertex-facet incidences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of polytope isomorphism problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum numbers of faces of a convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of computing intersection, union and Minkowski sum of polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Revision as of 15:46, 8 July 2024

scientific article
Language Label Description Also known as
English
Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
scientific article

    Statements

    Identifiers