A linear algorithm for the Hamiltonian completion number of the line graph of a tree.
Alessandro AgnetisPaolo DettiCarlo MeloniDario PacciarelliPublished in: Inf. Process. Lett. (2001)
Keyphrases
- computational complexity
- graph structure
- tree structure
- learning algorithm
- detection algorithm
- polynomial time complexity
- binary tree
- space complexity
- np hard
- k means
- linear complexity
- minimum spanning tree
- dynamic programming
- simulated annealing
- segmentation algorithm
- memory requirements
- search space
- expectation maximization
- graph based algorithm
- maximum flow
- optimal solution
- spanning tree
- random graphs
- decision trees
- similarity measure
- matching algorithm
- clustering method
- np complete
- probabilistic model