Complexity of the hamiltonian cycle in regular graph problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 1994

Complexity of the hamiltonian cycle in regular graph problem

Dates et versions

hal-02436852 , version 1 (13-01-2020)

Identifiants

Citer

Christophe Picouleau. Complexity of the hamiltonian cycle in regular graph problem. Theoretical Computer Science, 1994, 131 (2), pp.463-473. ⟨10.1016/0304-3975(94)90185-6⟩. ⟨hal-02436852⟩
21 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More