Skip Navigation


The Computer Journal Advance Access originally published online on June 18, 2007
The Computer Journal 2008 51(1):122-136; doi:10.1093/comjnl/bxm038
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
51/1/122    most recent
bxm038v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Sloper, C.
Right arrow Articles by Telle, J. A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2008. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

An Overview of Techniques for Designing Parameterized Algorithms

Christian Sloper and Jan Arne Telle*

Department of Informatics, University of Bergen, Bergen, Norway

* Corresponding author: telle{at}ii.uib.no

Received 8 August 2006; revised 13 November 2006

A survey of the most important and general techniques in parameterized algorithm design is given. Each technique is explained with a meta-algorithm, its use is illustrated by examples, and it is placed in a taxonomy under the four main headings of branching, kernelization, induction and win/win.

Key Words: Parameterized algorithms • fixed-parameter tractability


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.