On the complexity of polytope isomorphism problems
From MaRDI portal
Publication:1401558
zbMath1029.68116arXivmath/0106093MaRDI QIDQ1401558
Volker Kaibel, Alexander Schwartz
Publication date: 18 August 2003
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0106093
Equivalence of polytopesGraph isomorphism completeGraph isomorphism hardPolytope congruencePolytope isomorphism
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
The complexity of Boolean matrix root computation, Drawing polytopal graphs with {\texttt{polymake}}, Algorithms for highly symmetric linear and integer programs, Applications of dimensionality reduction and exponential sums to graph automorphism, Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism, The Structure of Level-k Phylogenetic Networks, The complete enumeration of 4-polytopes and 3-spheres with nine vertices, Exploiting Symmetries in Polyhedral Computations, Classification of eight-dimensional perfect forms
Uses Software
