570 search results - page 21 / 114 » Edge Coloring with Delays |
104
click to vote
CGF
2010
14 years 12 months ago
2010
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
DAM
2006
14 years 11 months ago
2006
Given a rectangular array where entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each colo...
128
click to vote
MMM
2011
Springer
14 years 3 months ago
2011
Springer
As the resolution of output device increases, the demand of high resolution contents has become more eagerly. Therefore, the image superresolution algorithms become more important....
JGT
2007
14 years 11 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
DM
2010
14 years 12 months ago
2010
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...