مرکز منطقه ای اطلاع رساني علوم و فناوري - Linear-time optimal augmentation for componentwise bipartite-completeness of graphs

Title of article :

Linear-time optimal augmentation for componentwise bipartite-completeness of graphs

Author/Authors :

Ming-Yang Kao، نويسنده ,

Issue Information :

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

Pages :

From page :

To page :

Keywords :

Design of algorithms , analysis of algorithms , Combinatorial problems

Journal title :

Information Processing Letters

Serial Year :

1995

Journal title :

Information Processing Letters

Record number :

128237

Link To Document :