Abstract
Optimal parallel algorithms are given for two hard problems (the Hamiltonian cycle and the travelling salesman problem) restricted to graphs having a simple structure — Halin graphs. These problems were previously investigated for Halin graphs from the sequential point of view [1,5,6]. The travelling salesman problem (the computation of the shortest Hamiltonian cycle) for the Halin graph is interesting because such a graph can contain an exponential number of Hamiltonian cycles. Two tree-oriented algorithmic techniques are used: computation of products for paths of the tree (which gives log2n time algorithm for the Hamiltonian cycle) and a special parallel pebble game (giving log2n time for the travelling salesman problem).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Bibliography
G. Cornnuejols, D. Nadoff, W. Pullybank. Halin graphs and the travelling salesman problem. Math.Progr. 26 (1983) 287–294
A. Gibbons, W.Rytter. Efficient parallel algorithms. Cambridge University Press (1988)
A. Gibbons, W. Rytter. Optimal parallel algorithms for dynamic expression evaluation and context-free recognition. Information and Computation 81 (1989), 32–45.
W. Rytter. Fast parallel omputations for some dynamic programming problems. Theor. Computer Science (1988)
M.Syslo. NP-complete problems on some tree structured graphs. WG'83 (ed. M. Nagl).
M. Syslo, A. Proskurowski. On Halin graphs, in M. Borowiecki, J.W. Kennedy, M. Syslo (Editors), Graph Theory-Lagow 1981, LN in Maths, Springer-Verlag, Berlin-Heidelberg, 1983.
R.E. Tarjan, U. Vishkin, An Efficient Parallel Biconnectivity Algorithm, SIAM J.Comput. 14:4(1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diks, K., Rytter, W. (1989). Optimal parallel computations for halin graphs. In: Djidjev, H. (eds) Optimal Algorithms. OA 1989. Lecture Notes in Computer Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51859-2_21
Download citation
DOI: https://doi.org/10.1007/3-540-51859-2_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51859-4
Online ISBN: 978-3-540-46831-8
eBook Packages: Springer Book Archive