An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs.
Ludek KuceraPublished in: STACS (1985)
Keyphrases
- cost function
- optimization algorithm
- search space
- experimental evaluation
- computational complexity
- k means
- significant improvement
- matching algorithm
- theoretical analysis
- computationally efficient
- particle swarm optimization
- high accuracy
- detection algorithm
- computational cost
- np hard
- preprocessing
- similarity measure
- learning algorithm
- single pass
- times faster
- improved algorithm
- neural network
- multi objective
- optimal solution
- segmentation algorithm
- worst case
- semi supervised
- test cases
- tree structure
- training set
- combinatorial optimization
- objective function