On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

Abstract

We investigate the parameterized complexity of the following edge coloring problem motivated by the problem of channel assignment in wireless networks. For an integer q > 2 and a graph G, the goal is to find a coloring of the edges of G with the maximum number of colors such that every vertex of the graph sees at most q colors. This problem is NP-hard for q… (More)
DOI: 10.1007/978-3-642-40313-2_44

Topics

2 Figures and Tables

Cite this paper

@inproceedings{Goyal2013OnTP, title={On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem}, author={Prachi Goyal and Vikram Kamat and Neeldhara Misra}, booktitle={MFCS}, year={2013} }