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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Parallel algorithms and applications Ročník 19; číslo 1; s. 19 - 32
Hlavní autoři:	Kumar Datta, Alak, Kumar Sen†, Ranjan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Taylor & Francis GroupAbingdon, UK 01.03.2004
Témata:	F.2.2 Matching Parallel graph algorithms Parallel random access machines Vertex cover
ISSN:	1063-7192
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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 Theoretical Computer Science, Vol. A, pp 869-941]. In this paper, we resolve this by presenting a parallel algorithm on the EREW-PRAM that works in time using O(n) number of processors, where Δ(G) is the degree of the graph.
ISSN:	1063-7192
DOI:	10.1080/1063719042000208827