An O(nlogn) Algorithms for Minimal Paths Cover in Circular-Arc Graphs

Y. Daniel Liang, G. K. Manacher

Research output: Contribution to book or proceedingChapter

Original languageAmerican English
Title of host publicationProceedings of the 21st ACM Computer Science Conference
StatePublished - 1993

DC Disciplines

  • Computer Sciences

Cite this