Skip Navigation


The Computer Journal Advance Access originally published online on June 28, 2007
The Computer Journal 2008 51(3):363-371; doi:10.1093/comjnl/bxm039
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
51/3/363    most recent
bxm039v1
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 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 Gutin, G.
Right arrow Articles by Yeo, A.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Some Parameterized Problems On Digraphs

Gregory Gutin1,2,* and Anders Yeo1

1 Department of Computer Science, Royal Holloway University of London, Egham, Surrey TW20 0EX, UK
2 Department of Computer Science, University of Haifa, Israel

* Corresponding author: gutin{at}cs.rhul.ac.uk

Received 15 March 2006; revised 4 February 2007

We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problems and directed k-leaf problems. We also prove some new results on the topic. Most of these new results are on parameterizations of the backward paired comparison problem.

Key Words: parameterized algorithm; diagraphs


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.