An Algorithm to Construct Completely Independent Spanning Trees in Line Graphs.
Yifeng WangBaolei ChengJianxi FanYu QianRuofan JiangPublished in: Comput. J. (2022)
Keyphrases
- spanning tree
- learning algorithm
- detection algorithm
- computational complexity
- preprocessing
- minimum spanning tree
- search space
- k means
- graph structure
- matching algorithm
- minimum spanning trees
- depth first search
- times faster
- expectation maximization
- np hard
- optimal solution
- objective function
- directed graph
- segmentation algorithm
- random graphs