@inproceedings{7c2f260ba8114af2abd3e8425f125b16,
title = "O (n logn) algorithm for finding a minimal path cover in circular-arc graphs",
abstract = "Whether there exists a polynomial algorithm for the minimal path cover problem in circular-arc graphs remains open. In this paper, we present a polynomial time algorithm for finding a minimal path cover for a set of n arcs in a circular-arc model. Our algorithm takes O (n logn) time.",
author = "Liang, {Y. Daniel} and Manacher, {Glenn K.}",
year = "1993",
language = "English",
isbn = "0897915585",
series = "1993 ACM Computer Science Conference",
publisher = "Publ by ACM",
pages = "390--397",
booktitle = "1993 ACM Computer Science Conference",
note = "Proceedings of the 21st Annual ACM Computer Science Conference ; Conference date: 16-02-1993 Through 18-02-1993",
}