Bounded fixed-parameter tractability and reducibility

We study a refined framework of parameterized complexity theory where the parameter dependence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a function in some family ℱ . For every family ℱ of functions, this yields a notion of ℱ - fixed-parameter tractability. If ℱ is...

Full description

Bibliographic Details

Published in:	Annals of pure and applied logic Vol. 148; no. 1; pp. 1 - 19
Main Authors:	Downey, Rod, Flum, Jörg, Grohe, Martin, Weyer, Mark
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.09.2007
Subjects:	Parameterized complexity theory Reductions Reductions Parameterized complexity theory
ISSN:	0168-0072
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!