On a new high dimensional Weisfeiler-Lehman algorithm
type: Item
instance of: scholarly article
title: On a new high dimensional Weisfeiler-Lehman algorithm
zbMATH Open document ID: 0936.05070
DOI: 10.1023/A:1018672019177
author: S. A. Evdokimov
author: Marek Karpinski
author: Ilya Ponomarenko
published in: Journal of Algebraic Combinatorics
publication date: 2000-05-25T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1319551
zbMATH Keywords: graph isomorphism problem
zbMATH Keywords: permutation group
zbMATH Keywords: cellular algebra
zbMATH Keywords: automorphism group
zbMATH Keywords: Weisfeiler-Lehman algorithm
zbMATH Keywords: Schurian closure
MaRDI profile type: Publication
cites work: Q5609154
cites work: On the order of uniprimitive permutation groups
cites work: Q4871775
cites work: An optimal lower bound on the number of variables for graph identification
cites work: Coherent algebras and the graph isomorphism problem
cites work: Q4198056
cites work: Coherent algebras
cites work: Q3884286
cites work: A note on the graph isomorphism counting problem
cites work: On computation complexity problems concerning relation algebras
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: a:1018672019177
OpenAlex ID: W1534248534
description: scientific article; zbMATH DE number 1319551