首页   按字顺浏览 期刊浏览 卷期浏览 A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH
A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH

 

作者: ALAKK. DATTA,   RANJANK. SEN,  

 

期刊: Parallel Algorithms and Applications  （Taylor Available online 1995）
卷期: Volume 5, issue 3-4  

页码: 161-164

 

ISSN:1063-7192

 

年代: 1995

 

DOI:10.1080/10637199508915482

 

出版商: Taylor & Francis Group

 

关键词: Depth-first-search;interval graphs;matching;parallel graph algorithms;planar graphs;vertex cover

 

数据来源: Taylor

 

摘要:

We present a new parallel algorithm for finding a maximal matching of a graph. The time required by our algorithm isO(TD(n) logn) and the number of processors used isPD(n), whereTD(n) andPD(n) are the time and number of processors needed for a Depth First Search (DFS) of the graph.

 

点击下载:  PDF (83KB)



返 回