Node-independent spanning trees in Gaussian networks.
Zaid HussainBader F. AlBdaiwiAnton CernýPublished in: J. Parallel Distributed Comput. (2017)
Keyphrases
- spanning tree
- edge weights
- root node
- undirected graph
- edge disjoint
- minimum spanning tree
- leaf nodes
- minimum cost
- minimum spanning trees
- neighboring nodes
- small world networks
- wireless sensor networks
- network nodes
- network analysis
- overlapping communities
- quality of service
- maximum likelihood
- small world
- graph structure
- network structure
- path length
- network topologies
- weighted graph
- criminal networks
- betweenness centrality
- computational complexity