Login / Signup

An NP-hard problem in bipartite graphs.

M. S. Krishnamoorthy
Published in: SIGACT News (1975)
Keyphrases