Abstract
This paper describes an O(log2 n) time, n processor EREW PRAM algorithm to determine if there is a Hamiltonian path in an interval graph. If there is a Hamiltonian path, we can find it within the same resource bounds. Many graph theoretic problems including finding all maximal cliques, optimal coloring, minimum clique cover, minimum weight dominating set, and maximum independent set were previously known to be in NC when restricted to interval graphs. However, the Hamiltonian path problem was open and resisted classification until now. We also show that testing whether an interval graph has a Hamiltonian circuit can be done in NC 2. If the intervals are presorted, our parallel approach leads to an O(nα(n)) sequential algorithm, where α(n) is the inverse of Ackermann's function. This improves on the previous bound of O(n log log n) for the sequential case with presorted intervals.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This research supported by a grant from the Purdue University Research Foundation.
This research was partially funded by the National Science Foundation grant CCR-9209184.
Preview
Unable to display preview. Download preview PDF.
References
A. A. Bertossi and S. Moretti. Parallel algorithms on circular-arc graphs. Information Processing Letters 33(6) (1990) 275–281.
M. S. Chang, S. L. Pang, and J. L. Liaw. Deferred-query — an efficient approach for some problems on interval graphs. Manuscript, 1993.
R. Cole. Parallel merge sort. SIAM Journal on Computing 17(4) (1988) 770–785.
E. Dekel and S. Sahni. A parallel algorithm for convex bipartite graphs. Proceedings International Conference on Parallel Processing (1982) 178–184.
Faith E. Fich. The complexity of computation on the parallel random access machine. In Reif [18], chapter 20, pages 843–899.
M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.
P. C. Gilmore and A. J. Hoffman. A characterization of comparability graphs and of interval graphs. Canadian Journal of Mathematics 16 (1964) 539–548.
R. Greenlaw, H. J. Hoover, and W. L. Ruzzo.Topics in Parallel Computation: A Guide to the Theory of P-completeness. Oxford University Press, New York, to appear.
C-W. Ho and R. C. T. Lee. Efficient parallel algorithms for finding maximum cliques, clique trees, and minimum coloring on chordal graphs. Information Processing Letters 28(6) (1988) 301–309.
R. M. Karp. Reducibility among combinatorial problems, in R. E. Miller and J. W. Thatcher, eds., Complexity of Computer Computations, Plenum Press, New York, (1972) 85–103.
R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In van Leeuwan [19], chapter 17, pages 869–941.
J. M. Keil. Finding Hamiltonian circuit in interval graphs. Information Processing Letters 20(4) (1985) 201–206.
Y. D. Liang, R. Greenlaw, and G. K. Manacher. NC 2 Algorithms Regarding Hamiltonian Paths and Circuits in Interval Graphs. Technical report 93-11, University of New Hampshire, 1993.
Y. D. Liang, G. K. Manacher, C. Rhee, and T. A. Mankus. An O(n log n) algorithm for finding Hamiltonian paths and circuits in circular-arc graphs. Manuscript, August, 1992.
W. Lipski Jr. and F. P. Preparata. Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Informatica 15(4) (1981) 329–346.
G. K. Manacher, T. A. Mankus, and A. J. Smith. An optimum O(n log n) algorithm for finding a canonical Hamiltonian circuit in a set of intervals. Information Processing Letters 35(4) (1990) 205–211.
J. Naor, M. Naor, and A. A. Schäffer. Fast parallel algorithms for chordal graphs. Proceedings 19th Ann. ACM Symposium on Theory of Computing (1987) 355–364.
John H. Reif, editor. Synthesis of Parallel Algorithms. Morgan Kaufman, San Mateo, CA, 1993.
Jan van Leeuwan, editor. Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity. M.I.T. Press/Elsevier, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liang, Y.D., Greenlaw, R., Manacher, G. (1994). NC2 Algorithms regarding Hamiltonian paths and circuits in interval graphs. In: Cosnard, M., Ferreira, A., Peters, J. (eds) Parallel and Distributed Computing Theory and Practice. CFCP 1994. Lecture Notes in Computer Science, vol 805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58078-6_5
Download citation
DOI: https://doi.org/10.1007/3-540-58078-6_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58078-2
Online ISBN: 978-3-540-48435-6
eBook Packages: Springer Book Archive