Abstract
We have presented in a unified way optimal parallel algorithms for the unweighted versions of the MiS, MCC, and MDS problem on circular-arc graphs using greedy methods. It would be interesting to investigate whether our techniques can be extended to obtain efficient sequential and parallel algorithms for the weighted versions of these problems.
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 is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M.J.Atallah and D.Z.Chen, Optimal Parallel Algorithm For the Minimum Circle-cover Problem. Tech Rept. CSD-TR-813, Purdue University, Sep 1988.
A. Apostolico and S.E. Hambrusch, Finding Maximum Cliques On Circular-arc Graphs, Infom. Proc. Lett., 26 (1987), pp.209–215.
Richard Cole, Parallel Merge Sort, SIAM J. Comp., 17(1988), pp.770–785.
R. Cole and U. Vishkin, Approximate Parallel Scheduling. Part I: The Basic Technique With Applications To Optimal Parallel List Ranking in Logarithmic Time, SIAM J. Comp., 17 (1988), pp. 128–142.
M.C. Golumbic, Algorithmic Graph Theory And Perfect Graphs (Academic press, New York, 1980)
M.C. Golumbic and Peter L. Hammer, Stability In Circular-Arc Graphs, J. Algorithms, 9 (1988), pp.314–320.
M.R. Gary and D.S. Johnson, Computers and Intractability: A Guide To The Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
W.L. Hsu, Maximum Weight Clique Algorithms For Circular-Arc Graphs And Circle Graphs, SIAM J. Comput., 14 (1985), pp.224–231.
W.L.Hsu and K.H.Tsai, Linear Algorithms On Circular-arc Graphs, unpublished manuscript (1988).
P.N. Klein, Efficient Parallel Algorithms For Chordal Graphs. 29th FOCS, 1988, pp.150–161.
P.N. Klein and J.H. Reif, An Efficient Parallel Algorithm For Planarity, J. Comp. Sys. Sci., 37(1988), pp.190–246.
R.E. Ladner and M.J. Fischer, Parallel Prefix Computation, J. of ACM, 24 (1980), pp.831–838.
S. Masuda and K. Nakajima, An Optimal Algorithm For Finding a Maximum Independent Set of a Circular-arc Graph, SIAM J. Comput., 17 (1988), pp.41–52.
W.K. Shih and W.L. Hsu, An O(n log n+ m log log n) Maximum Weight Clique Algorithm for Circular-Arc Graphs, Inform.Process. Lett. 31 (1989), pp. 129–134.
A. Tucker, An Efficient Test For Circular-arc Graphs, SIAM J. Comput., 9(1980), pp.1–24.
R.E. Tarjan and U. Vishkin, An Efficient Parallel Biconnectivity Algorithm, SIAM J. Comput., 14(1985), pp. 862–874.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao, A.S., Rangan, C.P. (1989). Optimal parallel algorithms on circular-arc graphs. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_31
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive