Walk refinement, walk logic, and the iteration number of the Weisfeiler-Leman algorithm.
Moritz LichterIlia PonomarenkoPascal SchweitzerPublished in: CoRR (2019)
Keyphrases
- computational complexity
- dynamic programming
- memory requirements
- objective function
- times faster
- optimization algorithm
- preprocessing
- space complexity
- computational effort
- improved algorithm
- np hard
- detection algorithm
- computationally efficient
- worst case
- small number
- computational cost
- recognition algorithm
- k means
- execution times
- learning algorithm
- matching algorithm
- classification algorithm
- similarity measure
- segmentation algorithm
- high accuracy
- experimental evaluation
- search space
- optimal solution
- simulated annealing
- cost function
- multi objective
- lower bound
- single scan