Sign in

The Maximum Colorful Arborescence problem: How (computationally) hard can it be?

Guillaume FertinJulien FradinGéraldine Jean
Published in: Theor. Comput. Sci. (2021)
Keyphrases
  • computationally hard
  • np hard
  • cooperative
  • higher order