A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.02.041 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091936180 / rank | |||
Normal rank | |||
Revision as of 01:29, 20 March 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
