Linear algorithms for parity path and two path problems on circular-arc graph

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Srinivasa Rao, A., & Pandu Rangan, C. (1989). Linear algorithms for parity path and two path problems on circular-arc graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 382 LNCS, pp. 267–290). Springer Verlag. https://doi.org/10.1007/3-540-51542-9_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free