Edge-Disjoint Node-Independent Spanning Trees in Dense Gaussian Networks.
Bader F. AlBdaiwiZaid HussainAnton CernýRobert E. L. AldredPublished in: CoRR (2016)
Keyphrases
- edge disjoint
- spanning tree
- edge weights
- root node
- total length
- undirected graph
- minimum spanning tree
- minimum cost
- leaf nodes
- minimum spanning trees
- densely connected
- neighboring nodes
- social networks
- complex networks
- maximum likelihood
- overlapping communities
- network nodes
- community detection
- computer networks
- network structure
- nonlinear functions
- power law
- criminal networks
- tree structure
- gaussian mixture
- community structure
- minimum total cost