Skip to main content
Conference Proceedings

Parallel approximation schemes for problems on planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 726 LNCS 145-156
DOI: 10.1007/3-540-57273-2_51
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes a technique to obtain NC Approximations Schemes for the Maximun Independent Set in planar graphs and related optimal action problems.

Cite

CITATION STYLE

APA

Díaz, J., Serna, M. J., & Torán, J. (1993). Parallel approximation schemes for problems on planar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 726 LNCS, pp. 145–156). Springer Verlag. https://doi.org/10.1007/3-540-57273-2_51

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