| Original language | American English |
|---|---|
| Title of host publication | Proceedings of the 21st ACM Computer Science Conference |
| State | Published - 1993 |
Disciplines
- Computer Sciences
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver
An O(nlogn) Algorithms for Minimal Paths Cover in Circular-Arc Graphs
- Y. Daniel Liang
- , G. K. Manacher
Research output: Contribution to book or proceeding › Chapter