مرکز منطقه ای اطلاع رساني علوم و فناوري - On the complexity of the multicut problem in bounded tree-width graphs and digraphs Original Research Article

Title of article :

On the complexity of the multicut problem in bounded tree-width graphs and digraphs Original Research Article

Author/Authors :

Cédric Bentz، نويسنده ,

Issue Information :

روزنامه با شماره پیاپی سال 2008

Pages :

From page :

1908

To page :

1917

Keywords :

NPNP-hardness , Bounded tree-width , APXAPX-hardness , Multicuts

Journal title :

Discrete Applied Mathematics

Serial Year :

2008

Journal title :

Discrete Applied Mathematics

Record number :

886788

Link To Document :