390 search results - page 47 / 78 » Computing shortest paths for any number of hops |
105
click to vote
GG
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Graph programs as introduced by Habel and Plump [8] provide a simple yet computationally complete language for computing functions and relations on graphs. We extend this...
124
click to vote
EUROMICRO
2007
IEEE
15 years 8 months ago
2007
IEEE
Multicast network services advantageously complement multimedia information and communication technologies, as they open up the realm for highly scalable multicustomer application...
156
click to vote
COR
2008
15 years 1 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
114
click to vote
TMC
2008
15 years 1 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
140
click to vote
CVPR
1998
IEEE
16 years 4 months ago
1998
IEEE
The Euclidean skeleton is essential for general shape representation. This paper provides an e cient method to extract a well-connected Euclidean skeleton by a neighbor bisector d...