The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs.
Sandra KieferDaniel NeuenPublished in: CoRR (2019)
Keyphrases
- computational complexity
- computational cost
- detection algorithm
- optimal solution
- preprocessing
- dynamic programming
- high accuracy
- search space
- significant improvement
- learning algorithm
- graph model
- optimization algorithm
- computationally efficient
- simulated annealing
- cost function
- objective function
- tree structure
- improved algorithm
- mobile robot
- experimental evaluation
- np hard
- particle swarm optimization
- expectation maximization
- video sequences
- times faster
- neural network
- graph theoretic
- minimum spanning tree
- graph theoretical
- graph isomorphism