مرکز منطقه ای اطلاع رساني علوم و فناوري - An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs

Title of article :

An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs

Author/Authors :

K. V. R. C. N. Kishore، نويسنده , , Sanjeev Saxena، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 2000

Pages :

From page :

145

To page :

151

Keywords :

Parallel algorithms , computational complexity , Maximal matching , graphs

Journal title :

Information Processing Letters

Serial Year :

2000

Journal title :

Information Processing Letters

Record number :

129260

Link To Document :