Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament (Q3786504): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(88)90042-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066708286 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 01:52, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament |
scientific article |
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
