Polynomial-time algorithm for isomorphism of graphs with clique-width at most three.
Bireswar DasMurali Krishna EnduriI. Vinod ReddyPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- graph isomorphism
- worst case
- computational complexity
- np hard
- preprocessing
- learning algorithm
- matching algorithm
- cost function
- dynamic programming
- k means
- special case
- optimal solution
- expectation maximization
- search space
- similarity measure
- linear programming
- segmentation algorithm
- clustering method
- randomized algorithm
- maximum weight
- adjacency graph
- genetic algorithm