Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements.
Martin GroheMoritz LichterDaniel NeuenPascal SchweitzerPublished in: CoRR (2023)
Keyphrases
- lower bound
- upper bound
- worst case
- graph matching
- lower and upper bounds
- branch and bound algorithm
- objective function
- branch and bound
- graph theory
- np hard
- upper and lower bounds
- data sets
- directed graph
- random graphs
- lower bounding
- graph theoretic
- graph partitioning
- weighted graph
- spanning tree
- graph mining
- data compression
- linear programming relaxation
- search space