A searching algorithm for finite embedded D-graphs with no more than k regions.
Armin HemmerlingPublished in: Bull. EATCS (1984)
Keyphrases
- detection algorithm
- k means
- adjacency graph
- computational complexity
- objective function
- cost function
- dynamic programming
- simulated annealing
- region of interest
- matching algorithm
- learning algorithm
- significant improvement
- optimization algorithm
- computational cost
- evolutionary algorithm
- graph structure
- graph clustering
- graph construction
- optimal solution
- hyper graph