BIROn - Birkbeck Institutional Research Online

    Computing minimum directed feedback vertex set in O(1.9977n)

    Razgon, Igor (2007) Computing minimum directed feedback vertex set in O(1.9977n). In: Italiano, G.F. and Moggi, E. and Luigi, L. (eds.) ICTCS 2007: Theoretical Computer Science. World Scientific, pp. 70-81.

    Full text not available from this repository.

    Abstract

    In this paper we propose an algorithm which, given a directed graph G, finds the minimum directed feedback vertex set (FVS) of G in O*(1.9977n) time and polynomial space. To the best of our knowledge, this is the first algorithm computing the minimum directed FVS faster than in O(2n). The algorithm is based on the branch-and-prune principle. The minimum directed FVS is obtained through computing of the complement, i.e. the maximum induced directed acyclic graph. To evaluate the time complexity, we use the measure-and-conquer strategy according to which the vertices are assigned with weights and the size of the problem is measured in the sum of weights of vertices of the given graph rather than in the number of the vertices.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 11 Oct 2021 11:02
    Last Modified: 11 Oct 2021 11:02
    URI: https://eprints.bbk.ac.uk/id/eprint/46238

    Statistics

    Downloads
    Activity Overview
    0Downloads
    20Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item