CORR
2010
Springer
13 years 4 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
COMGEO
2010
ACM
13 years 4 months ago
2010
ACM
A highway H is a line in the plane on which one can travel at a greater speed than in the remaining plane. One can choose to enter and exit H at any point. The highway time distanc...
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
13 years 4 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...
GISCIENCE
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...
ISMB
1997
13 years 5 months ago
1997
Seq7 is a newprogramfor generating multiple structure-based alignments of RNAsequences. Byusing a variant of Dijkstra’s algorithm to find the shortest path through a specially c...
SODA
1998
ACM
13 years 5 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
SIROCCO
1998
13 years 5 months ago
1998
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1...
CCCG
2003
13 years 5 months ago
2003
Suppose one has a line arrangement and one wants to find a shortest path from one point lying on a line of the arrangement to another such point. We look at a special case: the a...
CAINE
2004
13 years 5 months ago
2004
The problem of finding a shortest path is common to many different fields including transportation systems, mechanical systems and computer communications. Most telecommunication ...
AAAI
2004
13 years 5 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...