A linear algorithm for disjoint matchings in trees.
Ernest J. CockayneBert L. HartnellStephen T. HedetniemiPublished in: Discret. Math. (1978)
Keyphrases
- high accuracy
- learning algorithm
- k means
- tree structure
- optimal solution
- improved algorithm
- preprocessing
- cost function
- experimental evaluation
- worst case
- matching algorithm
- detection algorithm
- decision trees
- times faster
- closed form
- optimization algorithm
- computationally efficient
- np hard
- theoretical analysis
- input data
- path planning
- significant improvement
- recognition algorithm
- computational complexity
- linear systems
- binary tree
- linear complexity