Advanced search
Publication Cover
Parallel Algorithms and Applications Volume 5, 1995 - Issue 3-4
Journal homepage
16
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH

ALAK K. DATTA Department of Mathematics, Indian Institute of Technology, Kharagpur, 721302, India
&
RANJAN K. SEN Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, 721302, India
Pages 161-164 | Published online: 02 Mar 2007
 
Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.