Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most Three.
Bireswar DasMurali Krishna EnduriI. Vinod ReddyPublished in: COCOON (2016)
Keyphrases
- graph isomorphism
- worst case
- segmentation algorithm
- computational complexity
- preprocessing
- search space
- dynamic programming
- learning algorithm
- matching algorithm
- graph structure
- simulated annealing
- k means
- objective function
- special case
- polynomial time complexity
- graph search
- graph partitioning
- strongly polynomial
- approximation algorithms
- np complete
- expectation maximization
- np hard
- search algorithm
- optimal solution
- similarity measure