An efficient parallel graph edge matching algorithm and its applications

A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graphG(V,E) is proposed. It runs inO(logn) time with (M/logn+n) processors on an EREW PRAM for a class of graph set II, wheren=|V|, m=|E| and II includes at least (i) planar graphs; (ii) graphs of bounded ge...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computer science and technology Ročník 14; číslo 2; s. 153 - 158
Hlavní autoři: Ma, Jun, Ma, Shaohan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Beijing Springer Nature B.V 01.03.1999
Department of Computer Science, Shandong University, Jinan 250100, P.R. China
Témata:
Algorithms
Graph matching
Graphs
Matching
Processors
Studies
maximal edge matching
parallel graph algorithm
ISSN:1000-9000, 1860-4749
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í:A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graphG(V,E) is proposed. It runs inO(logn) time with (M/logn+n) processors on an EREW PRAM for a class of graph set II, wheren=|V|, m=|E| and II includes at least (i) planar graphs; (ii) graphs of bounded genus; and (iii) graphs of bounded maximum degree and so on. Our algorithm improves the previously known best algorithms by a factor of logn in the time complexity with linear number of processors on EREW PRAMs when the input is limited to II.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1000-9000
1860-4749
DOI:10.1007/BF02946522