An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs
Year: 1993
Type: conference-paper
Authors: Y. Daniel Liang, G. K. Manacher
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
OpenAlex ID: W2013507147
