A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time (Q5919023): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1805.06728 / rank | |||
Normal rank | |||
Revision as of 03:20, 19 April 2024
scientific article; zbMATH DE number 7270953
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time |
scientific article; zbMATH DE number 7270953 |
Statements
A distributed algorithm for finding Hamiltonian cycles in random graphs in \(O(\log n)\) time (English)
0 references
6 November 2020
0 references
distributed algorithm
0 references
Hamiltonian cycle
0 references
random graph
0 references
