Abstract
We propose a parallel algorithm which reduces the problem of computing Hamiltonian cycles in tournaments to the problem of computing Hamiltonian paths. The running time of our algorithm is O(log n) using O(n 2/log n) processors on a CRCW PRAM, and O(log n log log n) on an EREW PRAM using O(n 2/log n log log n) processors. As a corollary, we obtain a new parallel algorithm for computing Hamiltonian cycles in tournaments. This algorithm can be implemented in time O(log n) using O(n 2/log n) processors in the CRCW model, and in time O(log2 n) with O(n 2/log n log log n) processors in the EREW model.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Bar-Noy and J. Naor, Sorting, minimal feedback sets, and Hamiltonian paths in tournaments, SIAM J. Disc. Math Vol.3 No1 (1990), pp. 7–20.
R. Brent, The parallel evaluation of general arithmetic expressions, J. ACM 21 (1974), pp. 201–206.
P. Camion, Chemins et circuits Hamiltoniens des graphes complets, C.R. Acad. Sci. Paris (A) 249 (1959), pp. 2151–2152.
R. Cole and U. Vishkin, Approximate and exact parallel scheduling, part 1: the basic technique with applications to optimal parallel list ranking in logarithmic time, SIAM J. Comput. 17 (1988), pp. 128–142.
A. Gibbons and W. Rytter, Efficient Parallel Algorithms, Cambridge University
P. Hell and M. Rosenfeld, The complexity of finding generalized paths in tournaments, J. of Algorithms 4 (1982), pp. 303–309.
Y. Manoussakis, A linear-time algorithm for finding Hamiltonians cycles in tournaments, Discrete Applied Mathematics 36 (1992), pp. 199–201.
L. Redei, Ein Kombinatorischer satz, Acta Litt. Sci. Szeged (1934), pp. 39–43.
D. Soroker, Fast parallel algorithms for graphs and networks, Ph.D Thesis, Rept UCB/CSD87/390, Computer Science Division, university of California, Berkeley, CA (1987).
D. Soroker, Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament, Journal of Algorithms 9 (1988), pp. 276–286.
U. Vishkin, Implementation of simultaneous memory address access in models that forbid it, J. Algorithms 4 (1983), pp. 45–50.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bampis, E., El Haddad, M., Manoussakis, Y., Santha, M. (1993). A parallel reduction of Hamiltonian cycle to Hamiltonian Path in tournaments. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_44
Download citation
DOI: https://doi.org/10.1007/3-540-56891-3_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56891-9
Online ISBN: 978-3-540-47779-2
eBook Packages: Springer Book Archive