Arc-Disjoint Spanning Trees on Cube-Connected Cycles Networks.
Pierre FraigniaudChing-Tien HoPublished in: ICPP (1) (1991)
Keyphrases
- spanning tree
- edge disjoint
- edge weights
- minimum spanning tree
- minimum cost
- minimum spanning trees
- depth first search
- social networks
- pairwise
- data cube
- multi dimensional
- network structure
- network design
- network size
- network analysis
- computer networks
- connected components
- undirected graph
- markov chain
- upper bound
- telecommunication networks
- root node
- complex networks