Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap.
Noga AlonYair CaroRaphael YusterPublished in: J. Comb. Theory, Ser. B (1997)
Keyphrases
- spanning tree
- edge disjoint
- minimum spanning tree
- minimum cost
- weighted graph
- undirected graph
- edge weights
- directed graph
- minimum total cost
- root node
- graph structure
- leaf nodes
- hierarchical data structure
- tree structure
- random walk
- directed acyclic graph
- equivalence class
- tree shaped
- connected components
- structured data
- decision trees