721 search results - page 75 / 145 » Bounds on the k-domination number of a graph |
163
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
173
click to vote
PPAM
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
158
click to vote
FUIN
2006
15 years 6 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
183
click to vote
IANDC
2008
15 years 6 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
198
click to vote
TCC
2012
Springer
14 years 1 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...