Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm.
Frank FuhlbrückJohannes KöblerOleg VerbitskyPublished in: SIAM J. Discret. Math. (2021)
Keyphrases
- learning algorithm
- search space
- recognition algorithm
- objective function
- computational complexity
- detection algorithm
- computational cost
- preprocessing
- dynamic programming
- probabilistic model
- matching algorithm
- segmentation algorithm
- simulated annealing
- genetic algorithm
- cost function
- worst case
- optimal solution
- social networks
- graph structure
- color constancy
- color image segmentation
- adjacency graph