مرکز منطقه ای اطلاع رساني علوم و فناوري - On the sets of perfect matchings for two bipartite graphs

Title of article :

On the sets of perfect matchings for two bipartite graphs

Author/Authors :

Arnold Rosenbloom، نويسنده ,

Issue Information :

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

Pages :

From page :

To page :

Keywords :

Circuit complexity , Matching , computational complexity

Journal title :

Information Processing Letters

Serial Year :

1999

Journal title :

Information Processing Letters

Record number :

129073

Link To Document :