Login / Signup

On the complexity of packing rainbow spanning trees.

Kristóf BércziGergely CsájiTamás Király
Published in: CoRR (2022)
Keyphrases
  • spanning tree
  • edge disjoint
  • minimum spanning tree
  • computational complexity
  • undirected graph
  • worst case
  • minimum spanning trees
  • information systems
  • special case
  • space complexity
  • packing problem
  • root node