3 papers
cs.DM2026
On Numbers of Simplicial Walks and Equivalent Canonizations for Graph Recognition
Marek Černý
Two graphs are isomorphic exactly when they admit the same number of homomorphisms from every graph. Hence, a graph is recognized up to isomorphism by homomorphism counts over the…
cs.LG2025
Caterpillar GNN: Replacing Message Passing with Efficient Aggregation
Marek Černý
Message-passing graph neural networks (MPGNNs) dominate modern graph learning. Typical efforts enhance MPGNN's expressive power by enriching the adjacency-based aggregation. In con…
cs.CG2021
ICLR 2021 Challenge for Computational Geometry & Topology: Design and Results
Nina Miolane, Matteo Caorsi, Umberto Lupo +30
This paper presents the computational challenge on differential geometry and topology that happened within the ICLR 2021 workshop "Geometric and Topological Representation Learning…