Join Our Newsletter
52 search results - page 1 / 11 » On the computational complexity of strong edge coloring |
DAM
2002
12 years 5 months ago
2002
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 ...
PERCOM
2006
ACM
13 years 5 months ago
2006
ACM
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
PODC
2006
ACM
12 years 11 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
COCOON
2009
Springer
13 years 13 days ago
2009
Springer
We discuss the nearly equitable edge coloring problem on a multigraph and propose an eļ¬cient algorithm for solving the problem, which has a better time complexity than the previ...
IPPS
2003
IEEE
12 years 11 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
