Parallel Algorithm for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs

Algorithmica (New York)

Volumn 17, Issue 1, 1997, Pages 67-87

  Bang Jensen, J ^a   El Haddad, M ^b   Manoussakis, Y ^b   Przytycka, T M ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Graph algorithms; Hamilton cycle; Parallel algorithms; Randomized algorithms; Semicomplete bipartite graphs

Indexed keywords

EID: 0345877713     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02523239     Document Type: Article

References (23)

1. K. Abrahamson, N. Dadoun, D. G. Kirkpatrick, and T. Przytycka, A simple parallel tree contraction algorithm, J. Algorithms, 10 (1989), 287-302.
2. R. J. Anderson and G. L. Miller, Deterministic parallel list ranking, Proc. 3rd Egean Workshop on Computing, 1988, pp. 81-90.
3. E. Bampis, M. El Haddad, Y. Manoussakis, and M. Santha, A parallel reduction of hamilton cycle to hamilton path in tournaments, J. Algorithms, 19 (1995), 432-440.
4. J. Bang-Jensen, Arc-local tournament digraphs: a generalization of tournaments and bipartite tournaments, submitted.
5. J. Bang-Jensen, G. Gutin, and J. Huang, A sufficient condition for a complete multipartite digraph to be hamiltonian, Discrete Math., to appear.
6. A. Bar-Noy and J. Naor, Sorting, minimal feedback sets, and Hamiltonian paths in tournaments, SIAM J. Discrete Math., 3 (1990), 7-20.
7. L. W. Beineke and R. J. Wilson, Selected Topics in Graph Theory 3, Academic Press, New York, 1988.
8. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, MacMillan, New York, 1976.
9. R. P. Brent. The parallel evaluation of general arithmetic expressions, J. Assoc. Comput. Mach., 21 (1974), 201-208.
10. R. Cole, Parallel merge sort, SIAM J. Comput., 17 (1988), 770-785.
11. R. Cole and U. Vishkin, Approximate and exact parallel scheduling with applications to list, tree and graph problems, Proc. 27th IEEE Symp. on Foundations of Computer Science, 1986, pp. 478-491.
12. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetric progressions, Proc. 19th ACM Symp. on Theory of Computing, 1987, pp. 1-6.
13. A. V. Goldberg, S. A. Plotkin, and P. M. Vaidya, Sublinear-time parallel algorithms for matching and related problems. Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 174-185.
14. G. Gutin, A criterion for complete bipartite digraphs to be hamiltonian, Vestsī Acad. Navuk BSSR Ser. Fīz.-Mat. Navuk, No. 1 (1984), 99-100 (in Russian).
15. G. Gutin, Effective characterization of complete bipartite digraphs that have a hamiltonian path, Kibernetica, No. 4 (1985), 124-125 (in Russian).
16. P. Hell and M. Rosenfeld, The complexity of finding generalized paths in tournaments, J. Algorithms, 4 (1982), 303-309.
17. A. Israeli and Y. Shiloach. An improved parallel algorithm for maximal matching, Inform. Process. Lett., 22 (1986), 57-60.
18. R. M. Karp and V. Ramachandran, Parallel algorithms for shared-memory machines, in Handbook of Theoretical Computer Science, ed. J. Van. Leuwen, Elsevier, Amsterdam, 1990, pp. 869-941.
19. R. E. Ladner and M. J. Fisher, Parallel prefix sum computation. J. Assoc. Comput. Mach., 27 (1980), 830-838.
20. Y. Manoussakis, A linear-time algorithm for finding hamiltonian cycles in tournaments, Discrete Appl. Math., 36 (1992), 199-201.
21. G. L. Miller, V. Ramachandran, and E. Kaltofen, Efficient parallel evaluation of straight line code and arithmetic circuits, SIAM J. Comput., 17 (1988), 687-695.
22. G. L. Miller and J. Reif, Parallel tree contraction and its application, Proc. 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 478-489.
23. K. Mulmuley, U. V. Vazirani, and V. B. Vazirani, Matching is as easy as matrix inversion, Combinatorica, 7 (1987), 105-113.