MathematicsComputer Science
NP-Completeness of the Hamiltonian Cycle Problem for Bipartite Graphs
T. Akiyama, Takao Nishizeki, N. Saito
Resumen
El resumen no está disponible.
Formato de cita
AKIYAMA, T.; NISHIZEKI, Takao; SAITO, N. NP-Completeness of the hamiltonian cycle problem for bipartite graphs. Journal of Information Processing, 1980, 3: 73–76.