On a new high dimensional Weisfeiler-Lehman algorithm

DOI10.1023/A:1018672019177MaRDI QIDQ1296386zbMATH OpenOpenAlexFDO

Authors S. A. Evdokimov, Marek Karpinski, Ilya Ponomarenko

Publication date 25 May 2000

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1018672019177

zbMATH Keywords

automorphism grouppermutation groupcellular algebragraph isomorphism problemWeisfeiler-Lehman algorithmSchurian closure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• On highly closed cellular algebras and highly closed isomorphisms
• The Weisfeiler-Leman algorithm and the diameter of Schreier graphs
• Generalizations of k-dimensional Weisfeiler-Leman stabilization
• scientific article; zbMATH DE number 5013903

Cites work

• scientific article; zbMATH DE number 3689630 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 863496 (Why is no real title available?)
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• scientific article; zbMATH DE number 3332250 (Why is no real title available?)
• A note on the graph isomorphism counting problem
• An optimal lower bound on the number of variables for graph identification
• Coherent algebras
• Coherent algebras and the graph isomorphism problem
• On computation complexity problems concerning relation algebras
• 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 the order of uniprimitive permutation groups

Cited in

(11)

• Generalizations of k-dimensional Weisfeiler-Leman stabilization
• The graph isomorphism problem and approximate categories
• Fixed-point definability and polynomial time on chordal graphs and line graphs
• Permutation group approach to association schemes
• A new characterization of Elfving's method for high dimensional computation
• On p-covalenced association schemes
• Recognizing and testing isomorphism of Cayley graphs over an abelian group of order \(4p\) in polynomial time
• On the geometric graph isomorphism problem
• Circulant graphs: recognizing and isomorphism testing in polynomial time
• On the limitations of graph invariants inspired by quantum walks
• Schemes of a finite projective plane and their extensions

This page was built for publication: On a new high dimensional Weisfeiler-Lehman algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296386)