5606 search results - page 458 / 1122 » Randomization Techniques for Graphs. |
245
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
201
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
214
click to vote
TCBB
2010
15 years 1 months ago
2010
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
188
click to vote
PODC
2006
ACM
16 years 22 days ago
2006
ACM
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
211
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
istic Abstraction for Model Checking: an Approach Based on Property Testing∗ Sophie Laplante† Richard Lassaigne‡ Fr´ed´eric Magniez§ Sylvain Peyronnet† Michel de Rougemo...