Charles Darwin University

CDU eSpace
Institutional Repository

 
CDU Staff and Student only
 

FPT is P-Time Extremal Structure I (Fixed-parameter tractability is polynomial-time extremal structure theory)

Estivill-Castro, V., Fellows, Michael R., Langston, M. and Rosamond, Frances A. (2005). FPT is P-Time Extremal Structure I (Fixed-parameter tractability is polynomial-time extremal structure theory). In Broersma, H., Johnson, M. and Szeider, S.(Ed.), Algorithms and Complexity (Texts in Algorithmics 4). London: King's College Publications. (pp. 1-41).

Document type: Book Chapter
Citation counts: Google Scholar Search Google Scholar

Author Estivill-Castro, V.
Fellows, Michael R.
Langston, M.
Rosamond, Frances A.
Title of Chapter FPT is P-Time Extremal Structure I (Fixed-parameter tractability is polynomial-time extremal structure theory)
Title of Book Algorithms and Complexity (Texts in Algorithmics 4)
Place of Publication London
Publisher King's College Publications
Publication Year 2005
Editor Broersma, H.
Johnson, M.
Szeider, S.
ISBN 9781904987109   (check CDU catalogue open catalogue search in new window)
Start Page 1
End Page 41
Total Pages 40
 
Versions
Version Filter Type
Access Statistics: 15 Abstract Views  -  Detailed Statistics
Created: Tue, 28 Feb 2012, 22:22:13 CST