Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most 3.
Bireswar DasMurali Krishna EnduriI. Vinod ReddyPublished in: CoRR (2015)
Keyphrases
- graph isomorphism
- worst case
- preprocessing
- computational complexity
- detection algorithm
- dynamic programming
- probabilistic model
- expectation maximization
- segmentation algorithm
- search space
- np hard
- special case
- polynomial time complexity
- strongly polynomial
- objective function
- clustering method
- graph structure
- minimum spanning tree