Edge-disjoint spanning trees and forests of graphs.
Jiang ZhouChangjiang BuHong-Jian LaiPublished in: Discret. Appl. Math. (2021)
Keyphrases
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum spanning trees
- minimum cost
- undirected graph
- minimum weight
- weighted graph
- edge weights
- depth first search
- total length
- random forests
- social networks
- graph matching
- minimum total cost
- random forest
- approximation algorithms
- graph representation
- np hard
- high level