Le probleme d'etoiles pour graphes est np-complet.

François Lalonde

Published in: Discret. Math. (1981)

Keyphrases

np complete
computational complexity
double exponential
np hard
expert systems
decision making
natural language
search space
dynamic programming
scheduling problem