The $k$-Dimensional Weisfeiler-Leman Algorithm

July 22, 2019 · The Ethereal · + Add venue

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Neil Immerman, Rik Sengupta arXiv ID 1907.09582 Category cs.CC: Computational Complexity Cross-listed cs.DS, math.LO Citations 11 Last Checked 2 months ago
Abstract
In this note, we provide details of the $k$-dimensional Weisfeiler-Leman Algorithm and its analysis from Immerman-Lander (1990). In particular, we present an optimized version of the algorithm that runs in time $O(n^{k+1}\log n)$, where $k$ is fixed (not varying with $n$).
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Computational Complexity