Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm.
Frank FuhlbrückJohannes KöblerOleg VerbitskyPublished in: STACS (2020)
Keyphrases
- learning algorithm
- detection algorithm
- worst case
- objective function
- k means
- dynamic programming
- expectation maximization
- computational complexity
- preprocessing
- graph isomorphism
- genetic algorithm
- minimum spanning tree
- graph model
- graph structure
- recognition algorithm
- particle swarm optimization
- probabilistic model
- color images
- similarity measure
- segmentation algorithm
- computational cost
- np hard
- search space
- color image segmentation