A 2O (k) poly (n) algorithm for the parameterized Convex Recoloring problem

Igor Razgon

doi:10.1016/j.ipl.2007.05.007

A 2^{O (k)} poly (n) algorithm for the parameterized Convex Recoloring problem

Igor Razgon

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

In this paper we present a parameterized algorithm that solves the Convex Recoloring problem for trees in O (256^k * poly (n)). This improves the currently best upper bound of O (k (k / log k)^k * poly (n)) achieved by Moran and Snir.

Original language	English
Pages (from-to)	53-58
Number of pages	6
Journal	Information Processing Letters
Volume	104
Issue number	2
DOIs	https://doi.org/10.1016/j.ipl.2007.05.007
State	Published - 16 Oct 2007
Externally published	Yes

Keywords

Convex recoloring
Graph algorithms
Parameterized complexity

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2007.05.007

Cite this

@article{75ca55a9912e4fd2947160c05a0f835a,

title = "A 2O (k) poly (n) algorithm for the parameterized Convex Recoloring problem",

abstract = "In this paper we present a parameterized algorithm that solves the Convex Recoloring problem for trees in O (256k * poly (n)). This improves the currently best upper bound of O (k (k / log k)k * poly (n)) achieved by Moran and Snir.",

keywords = "Convex recoloring, Graph algorithms, Parameterized complexity",

author = "Igor Razgon",

year = "2007",

month = oct,

day = "16",

doi = "10.1016/j.ipl.2007.05.007",

language = "English",

volume = "104",

pages = "53--58",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - A 2O (k) poly (n) algorithm for the parameterized Convex Recoloring problem

AU - Razgon, Igor

PY - 2007/10/16

Y1 - 2007/10/16

N2 - In this paper we present a parameterized algorithm that solves the Convex Recoloring problem for trees in O (256k * poly (n)). This improves the currently best upper bound of O (k (k / log k)k * poly (n)) achieved by Moran and Snir.

AB - In this paper we present a parameterized algorithm that solves the Convex Recoloring problem for trees in O (256k * poly (n)). This improves the currently best upper bound of O (k (k / log k)k * poly (n)) achieved by Moran and Snir.

KW - Convex recoloring

KW - Graph algorithms

KW - Parameterized complexity

UR - http://www.scopus.com/inward/record.url?scp=34447645284&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2007.05.007

DO - 10.1016/j.ipl.2007.05.007

M3 - Article

AN - SCOPUS:34447645284

SN - 0020-0190

VL - 104

SP - 53

EP - 58

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -