Parallel algorithms for finding Hamilton cycles in random graphs (Q1108039): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90229-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996876354 / rank | |||
Normal rank | |||
Latest revision as of 18:43, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel algorithms for finding Hamilton cycles in random graphs |
scientific article |
Statements
Parallel algorithms for finding Hamilton cycles in random graphs (English)
0 references
1987
0 references
Hamilton cycle
0 references
parallel algorithm
0 references
random graph
0 references
dynamic programming
0 references
