Skip to main content
SpringerLink
Log in

Linear algorithms for parity path and two path problems on circular-arc graph

  • Conference paper
  • First Online:
Book cover Algorithms and Data Structures (WADS 1989)

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

Included in the following conference series:

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.

7. References

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

    Article  Google Scholar 

  2. A. Srinivasa Rao, Efficient Sequential and Parallel Algorithms on Interval and Circular-arc Graphs, M.S. Thesis, Dept. of Computer Science and Engg, Indian Inst of Tech, Madras, India, 1989.

    Google Scholar 

  3. M.A. Bonuccelli, Dominating Sets And Domatic Number Of Circular-arc Graphs, Discrete Appl. Math., 12(1985), pp.203–213.

    Article  Google Scholar 

  4. G.A. Cypher, The k Paths Problem, Ph.D. Dissertation, Yale University, 1980.

    Google Scholar 

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

    Google Scholar 

  6. P.C. Gilmore and A.J. Hoffman, A Characterization Of Comparability Graphs And Interval Graphs, Canad.J.Math., 16(1964), pp.539–548.

    Google Scholar 

  7. M.C. Golumbic and Peter L. Hammer, Stability In Circulararc Graphs, J. Algorithms, 9(1988), pp.314–320.

    Article  Google Scholar 

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

  9. Wen-Lian Hsu, Maximum Weight Clique Algorithms For Circular-arc Graphs And Circle Graphs, SIAM J. Comput., 14(1985), pp.224–231.

    Article  Google Scholar 

  10. Wen-Lian Hsu, Recognising Planar Perfect Graphs, J. Assoc. Comput. Mach., 34(1987), pp.255–288.

    Google Scholar 

  11. J.M. Keil, Finding Hamiltonian Circuits In Interval Graphs, Inform. Proc. Lett., 20(1985), pp. 201–206.

    Google Scholar 

  12. S.V. Krishnan, Seshadri and C. Pandu Rangan, A new Linear Algorithm For The Two Path Problem On Chordal Graphs, Eighth International Conference on Foundations of Software Technology & Theoretical Computer Science, Pune, India, Dec 21–23, 1988.

    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. Y. Perl and Y. Shiloach, Finding Two Disjoint Paths Between Two Pairs Of Vertices In a Graph, J. Assoc. Comput. Mach., 25(1978), pp.1–9.

    Google Scholar 

  15. G. Ramalingam and C. Pandu Rangan, A Unified Approach To Domination Problems On Interval Graphs, Inform. Proc. Lett., 27(1988), pp.271–274.

    Google Scholar 

  16. Y. Shiloach, A Polynomial Solution To The Undirected Two Path Problem, J. Assoc. Comput. Mach., 27(1980), pp.445–456.

    Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Scince and Engineering, Indian Institute of technology, 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

F. Dehne J. -R. Sack N. Santoro

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Srinivasa Rao, A., Rangan, C.P. (1989). Linear algorithms for parity path and two path problems on circular-arc graph. In: Dehne, F., Sack, J.R., Santoro, N. (eds) Algorithms and Data Structures. WADS 1989. Lecture Notes in Computer Science, vol 382. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51542-9_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-51542-9_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51542-5

  • Online ISBN: 978-3-540-48237-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation