 |
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
|
| |
|
|
|
| Access Statistics: |
15 Abstract Views -
Detailed Statistics
|
| Created: |
Tue, 28 Feb 2012, 22:22:13 CST
|
|
|
|
|