Abstract
We present a new parallel algorithm for finding a maximal matching of a graph. The time required by our algorithm is O(TD (n) logn) and the number of processors used is PD (n), where TD (n) and PD (n) are the time and number of processors needed for a Depth First Search (DFS) of the graph.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Parallel, Emergent and Distributed Systems
Paper Title
Journal
Date
