Sciweavers

2796 search results - page 93 / 560
» The coolest path problem
Sort
View
140
Voted
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
15 years 3 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
IPPS
1998
IEEE
15 years 9 months ago
NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
Sven Venema, Hong Shen, Francis Suraweera
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 5 months ago
Content-Based Routing of Path Queries in Peer-to-Peer Systems
Peer-to-peer (P2P) systems are gaining increasing popularity as a scalable means to share data among a large number of autonomous nodes. In this paper, we consider the case in whic...
Georgia Koloniari, Evaggelia Pitoura
EUROGRAPHICS
2010
Eurographics
16 years 1 months ago
Sketching Clothoid Splines Using Shortest Paths
Clothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, construc...
Ilya Baran, Jaakko Lehtinen, Jovan Popovic
AINA
2008
IEEE
15 years 11 months ago
Optimal Resource Discovery Paths of Gnutella2
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...