Skip to main content
SpringerLink
Log in

Optimal parallel algorithms on circular-arc graphs

  • Graph Algorithms
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 405))

  • 125 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. A. Apostolico and S.E. Hambrusch, Finding Maximum Cliques On Circular-arc Graphs, Infom. Proc. Lett., 26 (1987), pp.209–215.

    Article  Google Scholar 

  3. Richard Cole, Parallel Merge Sort, SIAM J. Comp., 17(1988), pp.770–785.

    Article  Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. M.C. Golumbic, Algorithmic Graph Theory And Perfect Graphs (Academic press, New York, 1980)

    Google Scholar 

  6. M.C. Golumbic and Peter L. Hammer, Stability In Circular-Arc Graphs, J. Algorithms, 9 (1988), pp.314–320.

    Article  Google Scholar 

  7. M.R. Gary and D.S. Johnson, Computers and Intractability: A Guide To The Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).

    Google Scholar 

  8. W.L. Hsu, Maximum Weight Clique Algorithms For Circular-Arc Graphs And Circle Graphs, SIAM J. Comput., 14 (1985), pp.224–231.

    Article  Google Scholar 

  9. W.L.Hsu and K.H.Tsai, Linear Algorithms On Circular-arc Graphs, unpublished manuscript (1988).

    Google Scholar 

  10. P.N. Klein, Efficient Parallel Algorithms For Chordal Graphs. 29th FOCS, 1988, pp.150–161.

    Google Scholar 

  11. P.N. Klein and J.H. Reif, An Efficient Parallel Algorithm For Planarity, J. Comp. Sys. Sci., 37(1988), pp.190–246.

    Article  Google Scholar 

  12. R.E. Ladner and M.J. Fischer, Parallel Prefix Computation, J. of ACM, 24 (1980), pp.831–838.

    Article  Google Scholar 

  13. 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.

    Article  Google Scholar 

  14. 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.

    Article  Google Scholar 

  15. A. Tucker, An Efficient Test For Circular-arc Graphs, SIAM J. Comput., 9(1980), pp.1–24.

    Article  Google Scholar 

  16. R.E. Tarjan and U. Vishkin, An Efficient Parallel Biconnectivity Algorithm, SIAM J. Comput., 14(1985), pp. 862–874.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, I.I.T., 600 036, Madras, India

    A. Srinivasa Rao & C. Pandu Rangan

Authors
  1. A. Srinivasa Rao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Pandu Rangan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. E. Veni Madhavan

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation