A two-stages tree-searching algorithm for finding three completely independent spanning trees.
Kung-Jui PaiRuay-Shiung ChangRo-Yu WuJou-Ming ChangPublished in: Theor. Comput. Sci. (2019)
Keyphrases
- spanning tree
- minimum spanning tree
- tree structure
- times faster
- learning algorithm
- edge disjoint
- optimal solution
- preprocessing
- similarity measure
- detection algorithm
- probabilistic model
- worst case
- dynamic programming
- computational complexity
- graphical models
- np hard
- matching algorithm
- evolutionary algorithm
- traveling salesman problem
- search algorithm
- binary tree
- depth first search
- objective function