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

Full description

Bibliographic Details

Published in:	Journal of computer science and technology Vol. 14; no. 2; pp. 153 - 158
Main Authors:	Ma, Jun, Ma, Shaohan
Format:	Journal Article
Language:	English
Published:	Beijing Springer Nature B.V 01.03.1999 Department of Computer Science, Shandong University, Jinan 250100, P.R. China
Subjects:	Algorithms Graph matching Graphs Matching Processors Studies maximal edge matching parallel graph algorithm
ISSN:	1000-9000, 1860-4749
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!