A subset D of the vertices of a graph is a dominating cycle if (i) every vertex not in D is adjacent to a vertex in D, and (ii) the subgraph induced by D has a Hamiltonian cycle. In this paper the authors present an optimal ¦](nlogn) time algorithm for the problem of finding a minimum cardinality dominating cycle in a circular-arc graph.
