On the Computational Complexity of Strong Edge Coloring (2002) [7 citations — 0 self]
by
Mohammad Mahdian
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@MISC{Mahdian02onthe,
author = {Mohammad Mahdian},
title = {On the Computational Complexity of Strong Edge Coloring},
year = {2002}
}
author = {Mohammad Mahdian},
title = {On the Computational Complexity of Strong Edge Coloring},
year = {2002}
}
Bookmarks
OpenURL
Abstract:
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In this paper, we will prove that this problem is NP-complete even in a very restricted setting. Also, a closely related problem, namely the maximum antimatching problem, is studied, and some NP-completeness results and a polynomial time algorithm for a subproblem are derived. Keywords: strong edge coloring; antimatching; induced matching; NP-completeness 1
