Work

An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs