389 citations · 1.1k across the 26 of their papers we have counts for
4 papers · 1 filter
Weisfeiler and Leman go Machine Learning: The Story so far
Christopher Morris, Yaron Lipman, Haggai Maron +5
In recent years, algorithms and neural architectures based on the Weisfeiler--Leman algorithm, a well-known heuristic for the graph isomorphism problem, have emerged as a powerful…
EmbAssi: Embedding Assignment Costs for Similarity Search in Large Graph Databases
Franka Bause, Erich Schubert, Nils M. Kriege
The graph edit distance is an intuitive measure to quantify the dissimilarity of graphs, but its computation is NP-hard and challenging in practice. We introduce methods for answer…
Metric Indexing for Graph Similarity Search
Franka Bause, David B. Blumenthal, Erich Schubert +1
Finding the graphs that are most similar to a query graph in a large database is a common task with various applications. A widely-used similarity measure is the graph edit distanc…
The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs
Christopher Morris, Matthias Fey, Nils M. Kriege
In recent years, algorithms and neural architectures based on the Weisfeiler-Leman algorithm, a well-known heuristic for the graph isomorphism problem, emerged as a powerful tool f…