Login / Signup

Constructing completely independent spanning trees in crossed cubes.

Baolei ChengDajin WangJianxi Fan
Published in: Discret. Appl. Math. (2017)
Keyphrases
  • spanning tree
  • completely independent
  • edge disjoint
  • minimum spanning trees
  • minimum spanning tree
  • minimum cost
  • undirected graph
  • finite state
  • edge weights
  • depth first search
  • feature space
  • root node