On the Weisfeiler algorithm of depth-1 stabilization

DOI10.1016/J.TCS.2025.115460MaRDI QIDQ6914018zbMATH OpenFDO

Authors Gang Chen, Qing Ren, Ilya Ponomarenko

Publication date 17 October 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115460

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial structures in finite projective spaces (51E20) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Cites work

• All self-complementary symmetric graphs
• An optimal lower bound on the number of variables for graph identification
• Coherent configurations. I: Ordinary representation theory
• Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
• Generalizations of k-dimensional Weisfeiler-Leman stabilization
• scientific article; zbMATH DE number 3332250 (Why is no real title available?)
• Identifiability of graphs with small color classes by the Weisfeiler-Leman algorithm
• 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 highly closed cellular algebras and highly closed isomorphisms
• On multidimensional Schur rings of finite groups
• On primitive cellular algebras
• On the WL-dimension of circulant graphs of prime power order
• Schemes of a finite projective plane and their extensions
• Separability number and Schurity number of coherent configurations

Cited in

(1)

• A lower bound for the Weisfeiler-Leman dimension of circulant graphs

This page was built for publication: On the Weisfeiler algorithm of depth-1 stabilization

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