On the geometric graph isomorphism problem
type: Item
instance of: scholarly article
title: On the geometric graph isomorphism problem
zbMATH Open document ID: 0871.68141
DOI: 10.1016/S0022-4049(97)00014-5
published in: Journal of Pure and Applied Algebra
publication date: 1997-10-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05E99
zbMATH DE Number: 1025699
zbMATH Keywords: graph isomorphism problem
zbMATH Keywords: computation complexity theory
author: S. A. Evdokimov
author: Ilya Ponomarenko
MaRDI profile type: Publication
cites work: Q5609154
cites work: On the order of uniprimitive permutation groups
cites work: Q3992965
cites work: An optimal lower bound on the number of variables for graph identification
cites work: Q5612629
cites work: Q4039784
cites work: Q5340151
cites work: On a new high dimensional Weisfeiler-Lehman algorithm
cites work: Isomorphism of coloured graphs with slowly increasing multiplicity of Jordan blocks
cites work: Two inequalities for parameters of a cellular algebra
cites work: Coherent algebras
cites work: Q3205264
cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time
cites work: Polynomial time algorithms for recognizing and isomorphism testing of cyclic tour-naments
cites work: 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
cites work: Q5512231
full work available at URL: s0022-4049(97)00014-5
OpenAlex ID: W2071931920
description: scientific article; zbMATH DE number 1025699