Constructing two completely independent spanning trees in hypercube-variant networks.

Kung-Jui Pai Jou-Ming Chang

Published in: Theor. Comput. Sci. (2016)

Keyphrases

spanning tree
completely independent
edge disjoint
minimum spanning tree
edge weights
minimum cost
minimum spanning trees
social networks
finite state
undirected graph
neural network
computational complexity
network structure
network analysis
network design