arXiv (OAI Expanded)
open access
The Classical Weisfeiler-Leman Algorithm Stabilizes in $O(n)$ Rounds
The classical Weisfeiler-Leman algorithm (also known as the $2$-dimensional Weisfeiler-Leman algorithm) is a simple combinatorial algorithm that was originally designed as a heuristic for the graph isomorphism problem. However, it has also numerous connections to other areas such as algebraic graph
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Balanced Spanning Trees for Triangular Strip Lattices#985594
- Prospective algorithms#248779
- On the Tutte polynomial of series-parallel posets#1064068
- Computational Design I: Theory and Applications#67031
- Completing the enumeration of inversion sequences avoiding triples of relations#1141239
Record · ID 1123729
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive