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. © 1989, Springer-Verlag.