4850 search results - page 10 / 970 » Approximate Data Structures with Applications |
110
Voted
STACS
2010
Springer
15 years 5 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 ...
86
Voted
CORR
2010
Springer
15 years 20 days 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...
CORR
2008
Springer
15 years 19 days ago
2008
Springer
BIOINFORMATICS
2004
15 years 13 days ago
2004
90
Voted
ALGORITHMICA
2008
15 years 5 days ago
2008