An algorithm to recognize a middle graph.
Miroslawa SkowronskaMaciej M. SysloPublished in: Discret. Appl. Math. (1984)
Keyphrases
- learning algorithm
- significant improvement
- dynamic programming
- computational complexity
- k means
- cost function
- np hard
- detection algorithm
- worst case
- times faster
- optimal solution
- graph structure
- clustering method
- shortest path problem
- preprocessing
- graph based algorithm
- high accuracy
- graph clustering
- experimental evaluation
- optimization algorithm
- objective function
- polynomial time complexity
- adjacency graph
- convergence rate
- structured data
- segmentation algorithm
- linear programming
- probabilistic model
- search space
- feature selection