10 citations · 12 across the 6 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
Generalizations of -Weisfeiler-Leman stabilization
Anuj Dawar, Danny Vagnozzi
The family of Weisfeiler-Leman equivalences on graphs is a widely studied approximation of graph isomorphism with many different characterizations. We study these, and other approx…
cs.LO2019
Approximations of Isomorphism and Logics with Linear-Algebraic Operators
Anuj Dawar, Erich Grädel, Wied Pakusa
Invertible map equivalences are approximations of graph isomorphism that refine the well-known Weisfeiler-Leman method. They are parametrised by a number k and a set Q of primes. T…
cs.LO2019
On the Power of Symmetric Linear Programs
Albert Atserias, Anuj Dawar, Joanna Ochremiak
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP…