473 search results - page 38 / 95 » Computing shortest paths with uncertainty |
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
ICPP
2009
IEEE
15 years 4 months ago
2009
IEEE
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
77
Voted
ICCAD
1994
IEEE
15 years 1 months ago
1994
IEEE
For a logic design with level-sensitive latches, we need to validate timing signal paths which may flush through several latches. We developed efficient algorithms based on the mo...
181
Voted
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
SIAMCOMP
2000
14 years 9 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...