An ::::O(n::::log::::n):::: Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs

Y. Daniel Liang, Glenn K. Manacher. An ::::O(n::::log::::n):::: Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. In ACM Conference on Computer Science. pages 390-397, 1993. [doi]

Abstract

Abstract is missing.