مرکز منطقه ای اطلاع رساني علوم و فناوري - On the complexity of finding balanced oneway cuts

Title of article :

On the complexity of finding balanced oneway cuts

Author/Authors :

Uriel Feige، نويسنده , , Orly Yahalom، نويسنده ,

Issue Information :

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

Pages :

From page :

To page :

Keywords :

Bisection , Directed graph , NP-hard , graph algorithms

Journal title :

Information Processing Letters

Serial Year :

2003

Journal title :

Information Processing Letters

Record number :

129732

Link To Document :