Showing 2025Show all
2 papers · 1 filter
cs.CC2025
Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
Marek Černý, Tim Seppelt
Two graphs and are homomorphism indistinguishable over a graph class if they admit the same number of homomorphisms from every graph . Many…
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…