An NP-hard problem in bipartite graphs
- 1 January 1975
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGACT News
- Vol. 7 (1), 26
- https://doi.org/10.1145/990518.990521
Abstract
Checking for Hamiltonian circuit in bipartite graphs is shown to be NP-hard.Keywords
This publication has 1 reference indexed in Scilit:
- Some simplified NP-complete problemsPublished by Association for Computing Machinery (ACM) ,1974