An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (Q4327819)
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: An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs |
scientific article; zbMATH DE number 742692
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs |
scientific article; zbMATH DE number 742692 |
Statements
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs (English)
0 references
20 August 1995
0 references
Hamiltonian cycle
0 references
CREW PRAM
0 references
