C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes.
Jia-Cian Lin
Jinn-Shyong Yang
Chiun-Chieh Hsu
Jou-Ming Chang
Published in:
Inf. Process. Lett. (2010)
Keyphrases
</>
edge disjoint
spanning tree
total length
minimum cost
minimum spanning tree
minimum weight
minimum spanning trees
undirected graph
computational complexity
root node
search space
special case
data processing
depth first search