A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (Q2379996): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.05.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1523101460 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quadratic Kernelization for Convex Recoloring of Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Connected Coloring Completion for General Graphs: Algorithms and Complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms and Data Structures / rank | |||
Normal rank | |||
Latest revision as of 14:24, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem |
scientific article |
Statements
A \(2^{O(k)}\)poly\((n)\) algorithm for the parameterized convex recoloring problem (English)
0 references
24 March 2010
0 references
graph algorithms
0 references
convex recoloring
0 references
parameterized complexity
0 references
