754 search results - page 127 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
133
Voted
IPSN
2009
Springer
15 years 10 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
159
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
184
Voted
DCG
2010
15 years 3 months ago
2010
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
153
click to vote
WADS
2001
Springer
15 years 8 months ago
2001
Springer
Even though a large number of I/O-efficient graph algorithms have been developed, a number of fundamental problems still remain open. For example, no space- and I/O-efficient algo...
133
click to vote
ICALP
1992
Springer
15 years 7 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...