Login / Signup
The Maximum Colorful Arborescence problem: How (computationally) hard can it be?
Guillaume Fertin
Julien Fradin
Géraldine Jean
Published in:
Theor. Comput. Sci. (2021)
Keyphrases
</>
computationally hard
np hard
cooperative
higher order