ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

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

Goyal, Prachi and Kamat, Vikram and Misra, Neeldhara (2013) On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem. In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS), AUG 26-30, 2013, IST Austria, Klosterneuburg, AUSTRIA, pp. 492-503.

[img] PDF
mat_fou_com_sci_8087_492_2013.pdf - Published Version
Restricted to Registered users only

Download (192kB) | Request a copy
Official URL: http://dx.doi.org/ 10.1007/978-3-642-40313-2_44


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 >= 2, and has been well-studied from the point of view of approximation. Our main focus is the case when q = 2, which is already theoretically intricate and practically relevant. We show fixed-parameter tractable algorithms for both the standard and the dual parameter, and for the latter problem, the result is based on a linear vertex kernel.

Item Type: Conference Proceedings
Series.: Lecture Notes in Computer Science
Additional Information: Copy right for this article belongs to the SPRINGER-VERLAG BERLIN, HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 19 Nov 2014 04:34
Last Modified: 19 Nov 2014 04:34
URI: http://eprints.iisc.ac.in/id/eprint/50289

Actions (login required)

View Item View Item