Login / Signup
Feedback arc set in bipartite tournaments is NP-complete.
Jiong Guo
Falk Hüffner
Hannes Moser
Published in:
Inf. Process. Lett. (2007)
Keyphrases
</>
np complete
database
neural network
social networks
approximation algorithms
randomly generated
polynomial time complexity