مرکز منطقه ای اطلاع رساني علوم و فناوري - Approximating the maximally balanced connected partition problem in graphs

Title of article :

Approximating the maximally balanced connected partition problem in graphs

Author/Authors :

Janka Chleb?kov?، نويسنده ,

Issue Information :

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

Pages :

From page :

225

To page :

230

Keywords :

analysis of algorithms , Combinatorial problems , Connected graphs

Journal title :

Information Processing Letters

Serial Year :

1996

Journal title :

Information Processing Letters

Record number :

128590

Link To Document :