@techreport{R-89-10,
TITLE = {A Parallel Algorithm for Maximum Matching in Planar Graphs},
AUTHOR = {Elias Dahlhaus and Marek Karpinski and Andrzej Lingas },
YEAR = {1989},
NUMBER = {R-89-10},
INSTITUTION = ida,
ADDRESS = idaaddr,
ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-89-10+abstr},
ABSTRACT = {We present a new parallel algorithm for finding a maximum cardinality matching in an arbitrary planar bipartite graph G. Our algorithm is processor-time efficient if the size l of a maximum cardinality matching of G is large. It runs in time O((0.5n -l+ sqrt (n)) (log n)**4) on a CRCW PRAM with O((n**1.5)log n) processors.},
IDANR = {LiTH-IDA-R-89-10}