3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.DM2026
The Complexity of Homomorphism Reconstruction Revisited
Timo Gervens, Martin Grohe, Louis Härtel +1
We revisit the algorithmic problem of reconstructing a graph from homomorphism counts that has first been studied in (Böker et al., STACS 2024): given graphs and c…
cs.LG2022★ 3 cited
A Practical, Progressively-Expressive GNN
Lingxiao Zhao, Louis Härtel, Neil Shah +1
Message passing neural networks (MPNNs) have become a dominant flavor of graph neural networks (GNNs) in recent years. Yet, MPNNs come with notable limitations; namely, they are at…