o(log4  n) time parallel maximal matching algorithm using linear number of processors

Computing maximal matching of a graph having n vertices in parallel within time using a linear number of processors on the EREW-PRAM is an open problem [Karp, R.M. and Ramachandran, V. (1990) "Parallel algorithms for shared-memory machines", In: van Leeuwen, J., ed., Handbook of Theoretica...

Full description

Bibliographic Details

Published in:	Parallel algorithms and applications Vol. 19; no. 1; pp. 19 - 32
Main Authors:	Kumar Datta, Alak, Kumar Sen†, Ranjan
Format:	Journal Article
Language:	English
Published:	Taylor & Francis GroupAbingdon, UK 01.03.2004
Subjects:	F.2.2 Matching Parallel graph algorithms Parallel random access machines Vertex cover
ISSN:	1063-7192
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!