Login / Signup

Improving the diameters of completely independent spanning trees in locally twisted cubes.

Kung-Jui PaiJou-Ming Chang
Published in: Inf. Process. Lett. (2019)
Keyphrases
  • spanning tree
  • completely independent
  • minimum spanning tree
  • edge disjoint
  • minimum cost
  • minimum spanning trees
  • undirected graph
  • data structure
  • shortest path
  • data cube
  • weighted graph
  • window search