An O(n log log n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees.
Takao AsanoPublished in: J. Comput. Syst. Sci. (1995)
Keyphrases
- learning algorithm
- preprocessing
- cost function
- objective function
- optimal solution
- matching algorithm
- np hard
- dynamic programming
- detection algorithm
- segmentation algorithm
- worst case
- graph based algorithm
- minimum spanning tree
- recognition algorithm
- experimental evaluation
- search space
- simulated annealing
- optimization algorithm
- significant improvement
- graph structure
- computational complexity
- decision trees
- genetic algorithm
- expectation maximization
- computational cost
- connected components
- maximum weight
- dominating set