A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
Paolo DettiCarlo MeloniPublished in: Discret. Appl. Math. (2004)
Keyphrases
- graph based algorithm
- computational complexity
- detection algorithm
- optimization algorithm
- k means
- expectation maximization
- linear complexity
- undirected graph
- convergence rate
- space complexity
- computational cost
- memory requirements
- closed form
- learning algorithm
- dynamic programming
- cost function
- polynomial time complexity
- graph theory
- tree structure
- worst case
- probabilistic model
- clustering method
- graph structure
- weighted graph
- np hard
- shortest path problem
- random graphs
- preprocessing
- randomized algorithm
- objective function
- total length
- similarity measure