Edge-disjoint node-independent spanning trees in dense Gaussian networks.
Bader F. AlBdaiwiZaid HussainAnton CernýRobert E. L. AldredPublished in: J. Supercomput. (2016)
Keyphrases
- weighted graph
- spanning tree
- edge disjoint
- densely connected
- edge weights
- minimum spanning tree
- root node
- minimum spanning trees
- undirected graph
- leaf nodes
- minimum total cost
- data objects
- total length
- network nodes
- small world networks
- maximum likelihood
- network analysis
- computer networks
- social networks
- overlapping communities
- neighboring nodes
- network structure