Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements.

Martin Grohe Moritz Lichter Daniel Neuen Pascal Schweitzer

Published in: FOCS (2023)

Keyphrases

lower bound
upper bound
branch and bound
objective function
branch and bound algorithm
sliding window
directed graph
np hard
graph matching
graph theory
graph mining
lower and upper bounds
graph representation
vc dimension
worst case
data mining
bipartite graph
undirected graph
lower bounding