Login / Signup

Congestion-free embedding of 2(n-k) spanning trees in an arrangement graph.

Yuh-Shyan ChenTong-Ying JuangYing-Ying Shen
Published in: J. Syst. Archit. (2001)
Keyphrases
  • spanning tree
  • edge disjoint
  • minimum spanning tree
  • undirected graph
  • minimum spanning trees
  • minimum cost
  • minimum weight
  • weighted graph
  • depth first search
  • edge weights
  • root node
  • total length
  • np hard
  • graph embedding