8 citations · 15 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2021★ 4 cited
Weisfeiler--Leman and Graph Spectra
Gaurav Rattan, Tim Seppelt
Two simple undirected graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues. Cospectrality yields an equivalence relation on the family…
cs.DS2018
Graph Similarity and Approximate Isomorphism
Martin Grohe, Gaurav Rattan, Gerhard J. Woeginger
The graph similarity problem, also known as approximate graph isomorphism or graph matching problem, has been extensively studied in the machine learning community, but has not rec…
cs.DS2018
Lovász Meets Weisfeiler and Leman
Holger Dell, Martin Grohe, Gaurav Rattan
In this paper, we relate a beautiful theory by Lovász with a popular heuristic algorithm for the graph isomorphism problem, namely the color refinement algorithm and its k-dimensio…