Abstract
Circular-arc graphs are an important class of intersection graphs. They have been applied to problems in genetics [17], traffic control [18], multidimensional scaling [11], computer compiler design [22], characterization of a certain class of lattices [19], and some other areas [13] [23]. Many sequential algorithms have been designed for circular-arc graphs(see, for example, [10] [14] [20] [21] [24]). The problem of coloring circulararc graphs has been investigated by Tucker [22], and the problem was later proved to be NP-complete by Garey, Johnson, Miller and Papadimitriou [6]. Bonuccelli [1] has shown that the domatic number problem for circular-arc graphs is NP-complete. In this paper, we give several parallel algorithms for circular-arc graphs and some subclasses of circular-arc graphs. We begin with the graph recognition problem, which is the first important problem for any class of graphs. It sets the foundation for solving many other problems of that class of graphs. Here we show, for the first time, three subclasses of circular-arc graphs can be recognized in polylogarithmic time with polynomially bounded processors. Specifically,
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
