Skip to main content
SpringerLink
Log in

NC algorithms for circular-arc graphs

  • Conference paper
  • First Online:
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.

References

  1. M.A. Bonuccelli, Dominating sets and domatic numbers of circular-arc graphs, Discrete Appl. Math. 12 (1985), 203–213.

    Article  Google Scholar 

  2. L. Chen, Y. Yesha, “Efficient parallel algorithms for recognizing transformable convex bipartite graphs and finding their maximum matchings”, OSU-CISRC-8/88-TR 26, The Ohio State University, 1988.

    Google Scholar 

  3. L. Chen, Y. Yesha, “Parallel algorithms: testing for interval graphs and the circular ones property”, OSU-CISRC-9/88-TR 29, The Ohio State University, 1988.

    Google Scholar 

  4. L. Chen, Y. Yesha, Fast parallel algorithms for bipartite permutation graphs, in “Proceedings 26th Ann. Allerton Conf. on Communication, Control, and Computing”, University of Illinois at Urbana-Champaign, 1988.

    Google Scholar 

  5. L. Chen, Efficient parallel algorithms for several intersection graphs, in “Proceedings Int'l Symp. on Circuits and Systems”, IEEE, 1989.

    Google Scholar 

  6. M.R. Garey, D.S. Johnson, G.L. Miller, C.H. Papadimitriou, The complexity of coloring circular arcs and chords, SIAM J. Algebraic and Discrete Methods 1 (1980), 216–227.

    Google Scholar 

  7. F. Gavril, Algorithms on circular-arc graphs, Networks 4 (1974), 357–369.

    Google Scholar 

  8. U.I. Gupta, D.T. Lee, J.Y.-T. Leung, Efficient algorithms for interval graphs and circular-arc graphs, Networks 12 (1982), 459–467.

    Google Scholar 

  9. W.-L. Hsu, Maximum weight clique algorithms for circular-arc graphs and circle graphs, SIAM J. Comp. 14 (1985), 224–231.

    Google Scholar 

  10. W.-L. Hsu, K. Tsai, Linear time algorithms on circular-arc graphs, in “Proceedings 26th Ann. Allerton Conf. on Communication, Control, and Computing”, University of Illinois at Urbana-Champaign, 1988.

    Google Scholar 

  11. L. Hubert, Some applications of graph theory and related non-metric techniques to problems of approximate seriation: the case of symmetric proximity measures, British J. Math. Statist. Psych. 27 (1974), 133–153.

    Google Scholar 

  12. P. Klein, Efficient parallel algorithms for chordal graphs, in “Proceedings 29th Ann. Symp. on Foundations of Computer Science”, IEEE Computer Society, 1988.

    Google Scholar 

  13. R.D. Luce, Periodic extensive measurement, Compositio Math. 23 (1971), 189–198.

    Google Scholar 

  14. S. Masuda, K. Nakajima, An optimal algorithm for finding a maximum independent set of a circulararc graph, SIAM J. Comput. 17 (1988), 41–52.

    Article  Google Scholar 

  15. A. Moitra, R. Johnson, PT-optimal algorithms for interval graphs, in “Proceedings 26th Ann. Allerton Conf. on Communication, Control, and Computing”, University of Illinois at Urbana-Champaign, 1988.

    Google Scholar 

  16. J. Naor, M. Naor, A.A. Schaeffer, Fast parallel algorithms for chordal graphs, in “Proceedings 19th Ann. ACM Symp. on Theory of Computing”, pp. 355–364, Association for Computing Machinery, 1987, and (a fuller version) IBM Research Report RJ5629, April 1987.

    Google Scholar 

  17. F.W. Stahl, Circular genetic maps, J. Cell. Physiol. 70 (Suppl. 1) (1967), 1–12.

    Google Scholar 

  18. K.E. Stouffers, Scheduling of traffic lights-a new approach, Transportation Res. 2 (1968), 199–234.

    Google Scholar 

  19. W. Trotter, J. Moore, Characterization problems for graphs, partially ordered sets, lattices, and families of sets, Discrete Math. 16 (1976), 361–381.

    Google Scholar 

  20. A.C. Tucker, Characterizing circular-arc graphs, Bull. Amer. Math. Soc. 76 (1970), 1257–1260.

    Google Scholar 

  21. A.C. Tucker, Matrix characterizations of circular-arc graphs, Pacific J. Math. 39 (1971), 535–545.

    Google Scholar 

  22. A.C. Tucker, Coloring a family of circular-arc graphs, SIAM J. Appl. Math. 29 (1975), 493–502.

    Google Scholar 

  23. A.C. Tucker, Circular-arc graphs: new uses and a new algorithm, in “Theory and Application of Graphs”, Lecture Notes in Math., Vol. 642, 580–589, Springer-Verlag, 1978.

    Google Scholar 

  24. A.C. Tucker, An efficient test for circular-arc graphs, SIAM J. Comput. 9 (1980), 1–24.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Science, The Ohio State University, 43210, Columbus, Ohio, USA

    Lin Chen

Authors
  1. Lin Chen
    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

Chen, L. (1989). NC algorithms for circular-arc graphs. 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_25

Download citation

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

  • 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