An Algorithm for the Decomposition of Complete Graph into Minimum Number of Edge-disjoint Trees.
Antika SinhaSanjoy Kumar SahaPartha BasuchowdhuriPublished in: CoRR (2024)
Keyphrases
- edge disjoint
- total length
- spanning tree
- computational complexity
- running times
- times faster
- decomposition algorithm
- learning algorithm
- memory requirements
- dynamic programming
- segmentation algorithm
- graph based algorithm
- worst case
- detection algorithm
- simulated annealing
- tree structure
- polynomial time complexity
- constant factor
- cost function
- optimal solution
- similarity measure
- maximum flow
- dominating set
- random graphs
- graph clustering
- graph structure
- minimum spanning tree
- edge weights
- graph construction
- graph partitioning
- space complexity
- tree decomposition
- directed graph
- clustering method
- root node
- maximum distance
- np complete
- np hard
- k means
- square error
- search space