STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel algorithms for finding Hamilton cycles in random graphs
Information Processing Letters
Expected computation time for Hamiltonian path problem
SIAM Journal on Computing
An algorithm for finding Hamilton paths and cycles in random graphs
Combinatorica - Theory of Computing
A simple linear expected time algorithm for finding a Hamilton path
Discrete Mathematics
Optimal parallel construction of Hamiltonian cycles and spanning trees in random graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Optimal distributed algorithm for minimum spanning trees revisited
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Distinctness of compositions of an integer: a probabilistic analysis
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
Extracting Large-Scale Knowledge Bases from the Web
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
A Random Graph Model for Optical Networks of Sensors
IEEE Transactions on Mobile Computing
The web as a graph: measurements, models, and methods
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Brief paper: Quantized consensus in Hamiltonian graphs
Automatica (Journal of IFAC)
| Hi-index | 0.00 |
In this paper, we present a distributed algorithm to find Hamiltonian cycles in $\mathcal{G}(n, p)$ graphs. The algorithm works in a synchronous distributed setting. It finds a Hamiltonian cycle in $\mathcal{G}(n, p)$ with high probability when $p=\omega(\sqrt{log n}/n^{1/4})$, and terminates in linear worst-case number of pulses, and in expected O(n3/4+ε) pulses. The algorithm requires, in each node of the network, only O(n) space and O(n) internal instructions.