A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast parallel algorithm for finding Hamiltonian cycles in dense graphs |
scientific article; zbMATH DE number 5565699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast parallel algorithm for finding Hamiltonian cycles in dense graphs |
scientific article; zbMATH DE number 5565699 |
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
