A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs☆
Under an Elsevier user license
open archive
Cited by (0)
- ☆
This work was supported in part by an Ohio State University Presidential Fellowship.
- ∗∗
Present affiliation: Department of Computer Science, State University of New York at Buffalo, Buffalo, NY 14260, U.S.A.
Copyright © 1988 Published by Elsevier B.V.