Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament (Q3786504)
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: Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament |
scientific article; zbMATH DE number 4049684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament |
scientific article; zbMATH DE number 4049684 |
Statements
Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament (English)
0 references
1988
0 references
parallel algorithm
0 references
directed graph
0 references
tournament
0 references
Hamiltonian path
0 references
strongly connected components
0 references
Hamiltonian cycle
0 references
0.845340371131897
0 references
0.8449065685272217
0 references
0.8424062132835388
0 references
0.8318446278572083
0 references
