370 search results - page 65 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
105
click to vote
MP
1998
14 years 11 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
107
Voted
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
190
click to vote
SPAA
2012
ACM
13 years 2 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
144
click to vote
JMLR
2010
14 years 6 months ago
2010
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
120
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...