3019 search results - page 181 / 604 » Approximating the Domatic Number |
189
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
153
click to vote
ISCAS
2003
IEEE
15 years 11 months ago
2003
IEEE
—The paper describes synthesis of a reactance network shaping a delayed quasi-rectangular pulse when the input step voltage is applied. The derivative of the step response is app...
164
click to vote
3DPVT
2002
IEEE
15 years 11 months ago
2002
IEEE
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marchi...
155
click to vote
RANDOM
2001
Springer
15 years 10 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
157
click to vote
FOCS
1996
IEEE
15 years 10 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...