On a new high dimensional Weisfeiler-Lehman algorithm

DOI10.1023/A:1018672019177zbMath0936.05070OpenAlexW1534248534MaRDI QIDQ1296386

Marek Karpinski, Sergei Evdokimov, Ilya Nikolaevich 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)

Related Items (10)

On the geometric graph isomorphism problem ⋮ On \(p\)-covalenced association schemes ⋮ The graph isomorphism problem and approximate categories ⋮ Generalizations of \(k\)-dimensional Weisfeiler-Leman stabilization ⋮ Recognizing and Testing Isomorphism of Cayley Graphs over an Abelian Group of Order 4p in Polynomial Time ⋮ Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs ⋮ Unnamed Item ⋮ Schemes of a finite projective plane and their extensions ⋮ Circulant graphs: recognizing and isomorphism testing in polynomial time ⋮ Permutation group approach to association schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coherent algebras and the graph isomorphism problem
• Coherent algebras
• On the order of uniprimitive permutation groups
• 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
• A note on the graph isomorphism counting problem
• On computation complexity problems concerning relation algebras

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