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.

Official URL: https://doi.org/10.1016/j.ipl.2007.05.007

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:	Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
Depositing User:	Sarah Hall
Date Deposited:	11 Oct 2021 10:32
Last Modified:	09 Aug 2023 12:52
URI:	https://eprints.bbk.ac.uk/id/eprint/46235

Statistics

Archive Staff Only (login required)