On the Combinatorial Power of the Weisfeiler-Lehman Algorithm


The classical Weisfeiler-Lehman method WL[2] uses edge colors to produce a powerful graph invariant. It is at least as powerful in its ability to distinguish non-isomorphic graphs as the most prominent algebraic graph invariants. It determines not only the spectrum of a graph, and the angles between standard basis vectors and the eigenspaces, but even the… (More)
DOI: 10.1007/978-3-319-57586-5_22

1 Figure or Table


  • Presentations referencing similar topics