A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary.
Ortrud OellermannJeremy P. SpinradPublished in: Inf. Process. Lett. (1995)
Keyphrases
- graph structure
- np hard
- distance metric
- graph based algorithm
- expectation maximization
- worst case
- optimization algorithm
- dynamic programming
- preprocessing
- computational complexity
- detection algorithm
- search space
- particle swarm optimization
- learning algorithm
- minimum spanning tree
- distance function
- dominating set
- segmentation algorithm
- vertex set
- convex hull
- matching algorithm
- ant colony optimization
- search algorithm
- optimal solution
- objective function
- image segmentation