Abstract
Two classical theorems about tournaments state that a tournament with no less than eight vertices admits an antidirected Hamiltonian path and an even cardinality tournament with no less than sixteen vertices admits an antidirected Hamiltonian cycle. Sequential algorithms for finding such a path as well as a cycle follow directly from the proofs of the theorems. Unfortunately, these proofs are inherently sequential and can not be exploited in a parallel context. In this paper we propose new proofs leading to efficient parallel algorithms.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
E. Bampis, M. El Haddad, Y. Manoussakis and M. Santha, A parallel reduction of Hamiltonian cycle to Hamiltonian path in tournaments, PARLE '93, Lect. Notes in Comp. Sc. 694 (1993) 553–560.
J. Bang-Jensen, Y. Manoussakis and C. Thomassen, A polynomial algorithm for Hamiltonian-connectedness in semicomplete graphs, Journal of Algorithms 13 (1992) 114–127.
J. Bang-Jensen and C. Thomassen, A polynomial algorithm for the 2-path problem for semicomplete digraphs, SIAM J. Discr. Math. (1992) 366–376.
A. Bar-Noy and J. Naor, Sorting, minimal feedback sets and Hamiltonian paths in tournaments, SIAM J. Discr. Math. 3 (1990) 7–20.
R. Brent, The parallel evaluation of general arithmetic expressions, J. ACM 21 (1974) 201–206.
R. Cole and U. Vishkin, Approximate and exact parallel scheduling with applications to list tree and graph problems, In Proc. 27th FOCS (1986) 478–491.
B. Grünbaum, Antidirected Hamiltonian paths in tournaments, J. Combin. Theory (B) 11 (1971) 249–257.
P. Hell and M. Rosenfeld, The complexity of finding generalized paths in tournaments, Journal of Algorithms 4 (1983) 303–309.
V. Petrovic, Antidirected Hamiltonian circuits in tournaments, In Proc. 4th Yogoslavian Seminar of Graph Theory, Novi Sad, 1983.
K. B. Reid and E. T. Parker, Disproof of a conjecture of Erdös and Moser, J. Combin. Theory (B) 9 (1970) 93–99.
M. Rosenfeld, Antidirected Hamiltonian paths in tournaments, J. Combin. Theory (B) 12 (1972) 93–99.
M. Rosenfeld, Antidirected Hamiltonian circuits in tournaments, J. Combin. Theory (B) 16 (1974) 234–242.
D. Soroker, Fast parallel algorithms for finding Hamiltonian paths and cycles in a tournament, Journal of Algorithms 9 (1988) 276–286.
C. Thomassen, Antidirected Hamiltonian circuits and paths in tournaments, Math. Ann. 201 (1973) 231–238.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bampis, E., Manoussakis, Y., Milis, I. (1995). NC algorithms for antidirected hamiltonian paths and cycles in tournaments. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds) Graph-Theoretic Concepts in Computer Science. WG 1994. Lecture Notes in Computer Science, vol 903. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59071-4_63
Download citation
DOI: https://doi.org/10.1007/3-540-59071-4_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59071-2
Online ISBN: 978-3-540-49183-5
eBook Packages: Springer Book Archive