Revisiting circular arc graphs

  • Lin Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 834)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. S. Booth and G. S. Lueker. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 13:335–379, 1976.Google Scholar
  2. [2]
    L. Chen. Efficient parallel recognition of some circular arc graphs, I. Algorithmica, 9(3):217–238, March 1993.Google Scholar
  3. [3]
    L. Chen and Y. Yesha. Parallel recognition of the consecutive ones property with applications. J. Algorithms, 12(3):375–392, September 1991.Google Scholar
  4. [4]
    L. Chen and Y. Yesha. Efficient parallel algorithms for bipartite permutation graphs. Networks, 23(1):29–39, January 1993.Google Scholar
  5. [5]
    J. Spinrad, A. Brandstädt, and L. Stewart. Bipartite permutation graphs. Discrete Applied Math., 18:279–292, 1987.Google Scholar
  6. [6]
    A. C. Tucker. Matrix characterization of circular-arc graphs. Pacific J. Math., 39(2):535–545, 1971.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Lin Chen
    • 1
  1. 1.Laboratory for Fundamental ResearchDuarte

Personalised recommendations