Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm.
Frank FuhlbrückJohannes KöblerOleg VerbitskyPublished in: CoRR (2019)
Keyphrases
- learning algorithm
- preprocessing
- optimization algorithm
- computational cost
- np hard
- cost function
- detection algorithm
- worst case
- similarity measure
- adjacency graph
- spanning tree
- color constancy
- graph partitioning
- recognition algorithm
- segmentation method
- graph isomorphism
- simulated annealing
- segmentation algorithm
- expectation maximization
- dynamic programming
- optimal solution
- objective function
- image sequences
- image processing