مرکز منطقه ای اطلاع رساني علوم و فناوري - The parameterized complexity of the induced matching problem Original Research Article

Title of article :

The parameterized complexity of the induced matching problem Original Research Article

Author/Authors :

Hannes Moser، نويسنده , , Somnath Sikdar، نويسنده ,

Issue Information :

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

Pages :

From page :

715

To page :

727

Keywords :

Tree decomposition , Kernelization , Induced matching , Parameterized complexity , Planar graph

Journal title :

Discrete Applied Mathematics

Serial Year :

2009

Journal title :

Discrete Applied Mathematics

Record number :

887007

Link To Document :