Login / Signup

Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks.

Shih-Shun KaoKung-Jui PaiSun-Yuan HsiehRo-Yu WuJou-Ming Chang
Published in: J. Comb. Optim. (2019)
Keyphrases
  • spanning tree
  • multiple independent
  • edge disjoint
  • minimum cost
  • edge weights
  • worst case
  • search tree
  • database
  • case study
  • computational complexity
  • bitstream