1 paper · 1 filter
Tim Seppelt, Gian Luca Spitzer
Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs G and H are called homomorphism indistinguishable over a g…