default search action
"The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs."
Ten-Hwang Lai, Shu-Shang Wei (1993)
- Ten-Hwang Lai, Shu-Shang Wei:
The Edge Hamiltonian Path Problem is NP-Complete for Bipartite Graphs. Inf. Process. Lett. 46(1): 21-26 (1993)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.