Searching for "Approximating Shortest Paths in Graphs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

1- Université catholique de Louvain- Machine Learning Group
by Victor Onclinx, Michel Verleysen, Vincent Wertz
… in the high-dimensional space Dij is approximated by the shortest path in the graph built through the 50…
Add To MetaCart

Random graphs with arbitrary i.i.d. degrees
by Gerard Hooghiemstra, Dmitri Znamenski — 2004
… process approximation of the shortest-path graph from a given node. For τ ∈ (1, 2) this branching process…
Cited by 5 (3 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB