BIROn - Birkbeck Institutional Research Online

    A fixed-parameter algorithm for the directed feedback vertex set problem

    Chen, J. and Liu, Y. and Lu, S. and O'Sullivan, B. and Razgon, Igor (2008) A fixed-parameter algorithm for the directed feedback vertex set problem. Journal of the ACM 55 (5), pp. 1-19. ISSN 0004-5411.

    Full text not available from this repository.

    Abstract

    The (parameterized) FEEDBACK VERTEX SET problem on directed graphs (i.e., the DFVS problem) is defined as follows: given a directed graph G and a parameter k, either construct a feedback vertex set of at most k vertices in G or report that no such a set exists. It has been a well-known open problem in parameterized computation and complexity whether the DFVS problem is fixed-parameter tractable, that is, whether the problem can be solved in time f(k)nO(1) for some function f. In this article, we develop new algorithmic techniques that result in an algorithm with running time 4k k! nO(1) for the DFVS problem. Therefore, we resolve this open problem.

    Metadata

    Item Type: Article
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 11 Jun 2013 12:37
    Last Modified: 11 Jun 2013 12:37
    URI: http://eprints.bbk.ac.uk/id/eprint/7446

    Statistics

    Downloads
    Activity Overview
    0Downloads
    144Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item