137 search results - page 10 / 28 » Optimising Node Coordinates for the Shortest Path Problem |
XSYM
2005
Springer
14 years 25 days ago
2005
Springer
Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using se...
WSDM
2010
ACM
14 years 4 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
SENSYS
2003
ACM
14 years 18 days ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
JCO
2006
13 years 7 months ago
2006
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, bec...
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
13 years 7 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...