513 search results - page 20 / 103 » Soft Edge Coloring |
91
Voted
TCS
2008
15 years 11 days ago
2008
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
109
Voted
FOCS
2002
IEEE
15 years 5 months ago
2002
IEEE
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5 ) colors. Our...
107
Voted
APPROX
2009
Springer
15 years 7 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
90
Voted
ICALP
2000
Springer
15 years 4 months ago
2000
Springer
: A 2-coloring of a hypergraph is a mapping from its vertex set to a set of two colors such that no edge is monochromatic. Let H = H k n p be a random k-uniform hypergraph on a ver...
95
Voted
ICIP
2009
IEEE
14 years 10 months ago
2009
IEEE
Chromatic aberration is a form of distortion in color optical devices that produces undesirable color fringes along borders within images. In this paper, we propose a novel method...