A Linear Algorithm for the Hamiltonian Completion Number of a Tree.
Sukhamay KunduPublished in: Inf. Process. Lett. (1976)
Keyphrases
- computational complexity
- learning algorithm
- times faster
- tree structure
- detection algorithm
- memory requirements
- computational effort
- space complexity
- particle swarm optimization
- improved algorithm
- piecewise linear
- linear systems
- computational cost
- dynamic programming
- cost function
- search space
- preprocessing
- scheduling problem
- linear programming
- significant improvement
- segmentation algorithm
- optimization algorithm
- linear complexity
- similarity measure
- neural network
- binary tree
- internal nodes
- boolean expressions
- graph structure
- pattern matching
- clustering method
- expectation maximization
- probabilistic model
- np hard
- k means
- objective function
- decision trees