Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

DAM
2002

favoriteEmaildiscussreport

82views more DAM 2002»

On the computational complexity of strong edge coloring

13 years 4 months ago

On the computational complexity of strong edge coloring

Download www.mahdian.org

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. ? 2002 Elsevier Science B.V. All rights reserved.

Mohammad Mahdian

Real-time Traffic

DAM 2002 | Edge Coloring Problem | Maximum Antimatching Problem | Related Problem |

claim paper

Related Content

» Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

» On the complexity of distributed graph coloring

» A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

» Channel Assignment on StronglySimplicial Graphs

» PerceptuallyInspired and EdgeDirected Color Image SuperResolution

» The Complexity of Bottleneck Labeled Graph Problems

» Weighted Coloring on Planar Bipartite and Split Graphs Complexity and Improved Approximati...

» Convergent transfer subgraph characterization and computation

» Accurate object contour tracking based on boundary edge selection

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	2002
Where	DAM
Authors	Mohammad Mahdian

Comments (0)