Our main result is a linear-time (that is, time $O(m + n)$) algorithm to recognize and represent proper circular-arc graphs. The best previous algorithm, due to A. Tucker, has time complexity $O(n^2 )$. We take advantage of the fact that (among connected graphs) proper ...
Xiaotie Deng hasn't uploaded this paper.
Let Xiaotie know you want this paper to be uploaded.
