5 citations · 6 across the 3 of their papers we have counts for
Showing 2019 · cs.CCShow all
2 papers · 2 filters
cs.CC2019★ 1 cited
On the Weisfeiler-Leman Dimension of Fractional Packing
V. Arvind, Frank Fuhlbrück, Johannes Köbler +1
The -dimensional Weisfeiler-Leman procedure (-WL), which colors -tuples of vertices in rounds based on the neighborhood structure in the graph, has proven to be immensely…
cs.CC2019
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
As it is well known, the isomorphism problem for vertex-colored graphs with color multiplicity at most 3 is solvable by the classical 2-dimensional Weisfeiler-Leman algorithm (2-WL…