On the geometric graph isomorphism problem

DOI10.1016/S0022-4049(97)00014-5zbMath0871.68141OpenAlexW2071931920MaRDI QIDQ1358911

Ilya Nikolaevich Ponomarenko, Sergei Evdokimov

Publication date: 5 October 1997

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-4049(97)00014-5

zbMATH Keywords

graph isomorphism problemcomputation complexity theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algebraic combinatorics (05E99)

Related Items (2)

The parameterized complexity of geometric graph isomorphism ⋮ Permutation group approach to association schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coherent algebras
• On the order of uniprimitive permutation groups
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments
• An optimal lower bound on the number of variables for graph identification
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• On a new high dimensional Weisfeiler-Lehman algorithm
• Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
• Two inequalities for parameters of a cellular algebra

This page was built for publication: On the geometric graph isomorphism problem