11 citations · 21 across the 7 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DM2022
A Study of Weisfeiler-Leman Colorings on Planar Graphs
Sandra Kiefer, Daniel Neuen
The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that computes colorings on graphs, which can often be used to detect their (non-)isomorphism. Particularly the 1- a…
cs.LG2022
SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks
Christopher Morris, Gaurav Rattan, Sandra Kiefer +1
While (message-passing) graph neural networks have clear limitations in approximating permutation-equivariant functions over graphs or general relational data, more expressive, hig…
cs.LO2022
Treelike decompositions for transductions of sparse graphs
Jan Dreier, Jakub Gajarský, Sandra Kiefer +2
We give new decomposition theorems for classes of graphs that can be transduced in first-order logic from classes of sparse graphs -- more precisely, from classes of bounded expans…