721 search results - page 70 / 145 » Bounds on the k-domination number of a graph |
270
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
151
click to vote
FOCS
2008
IEEE
16 years 22 days ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
191
click to vote
ISSS
2000
IEEE
15 years 10 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
154
click to vote
ESA
1994
Springer
15 years 10 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
162
click to vote
ESCAPE
2007
Springer
15 years 10 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...