The computational complexity of the backbone coloring problem for planar graphs with connected backbones

In the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance:A simple planar graph G, its connected spanning subgraph (backbone)...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 184; pp. 237 - 242
Main Authors: Janczewski, Robert, Turowski, Krzysztof
Format: Journal Article
Language:English
Published: Elsevier B.V 31.03.2015
Subjects:
Algorithms
Approximation
Backbone
Backbone chromatic number
Cacti
Coloring
Complexity
Computation
Graphs
Planar graphs
Backbone chromatic number
Planar graphs
Cacti
ISSN:0166-218X, 1872-6771
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance:A simple planar graph G, its connected spanning subgraph (backbone) H.Question:Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially solvable (by algorithms that run in constant, linear or quadratic time). As a result of these considerations we obtain a complete classification of the computational complexity with respect to the values of λ and k. We also study the problem of computing the backbone chromatic number for two special classes of planar graphs: cacti and thorny graphs. We construct an algorithm that runs in O(n3) time and solves this problem for cacti and another polynomial algorithm that is 1-absolute approximate for thorny graphs.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2014.10.028