A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477): Difference between revisions
From MaRDI portal
Latest revision as of 13:29, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast parallel algorithm for finding Hamiltonian cycles in dense graphs |
scientific article |
Statements
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (English)
0 references
17 June 2009
0 references
Hamiltonian cycle
0 references
parallel algorithm
0 references
0 references