مرکز منطقه ای اطلاع رساني علوم و فناوري - Polynomiality of sparsest cuts with fixed number of sources

Title of article :

Polynomiality of sparsest cuts with fixed number of sources

Author/Authors :

Sung-Pil Hong، نويسنده , , Byung-Cheon Choi، نويسنده ,

Issue Information :

دوماهنامه با شماره پیاپی سال 2007

Pages :

From page :

739

To page :

742

Keywords :

Sparsest cut problem , Fixed number of sources , Polynomiality

Journal title :

Operations Research Letters

Serial Year :

2007

Journal title :

Operations Research Letters

Record number :

137848

Link To Document :