388 search results - page 10 / 78 » An approximate algorithm for median graph computation using ... |
144
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
123
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
129
click to vote
PODC
2006
ACM
15 years 9 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
157
click to vote
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
238
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Abstract-- We present an original graph embedding to speedup distance-range and k-nearest neighbor queries on static and/or dynamic objects located on a (weighted) graph. Our metho...