BIROn - Birkbeck Institutional Research Online

    Exact computation of maximum induced forest

    Razgon, Igor (2006) Exact computation of maximum induced forest. In: Arge, L. and Freivalds, R. (eds.) SWAT 2006: Algorithm Theory. Lecture Notes in Computer Science 4059. Springer, pp. 160-171. ISBN 9783540357537.

    Full text not available from this repository.

    Abstract

    We propose a backtrack algorithm that solves a generalized version of the Maximum Induced Forest problem (MIF) in time O∗(1.8899n). The MIF problem is complementary to finding a minimum Feedback Vertex Set (FVS), a well-known intractable problem. Therefore the proposed algorithm can find a minimum FVS as well. To the best of our knowledge, this is the first algorithm that breaks the O∗(2n) barrier for the general case of FVS. Doing the analysis, we apply a more sophisticated measure of the problem size than the number of nodes of the underlying graph.

    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:51
    Last Modified: 11 Oct 2021 11:51
    URI: https://eprints.bbk.ac.uk/id/eprint/46242

    Statistics

    Downloads
    Activity Overview
    0Downloads
    21Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item