BIROn - Birkbeck Institutional Research Online

    A 2O(k)poly(n) algorithm for the parameterized convex recoloring problem

    Razgon, Igor (2007) A 2O(k)poly(n) algorithm for the parameterized convex recoloring problem. Information Processing Letters 104 (2), pp. 53-58. ISSN 0020-0190.

    Full text not available from this repository.

    Abstract

    In this paper we present a parameterized algorithm that solves the Convex Recoloring problem for trees in . This improves the currently best upper bound of achieved by Moran and Snir.

    Metadata

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

    Statistics

    Downloads
    Activity Overview
    0Downloads
    9Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item