Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
126
search results - page 26 / 26
»
infocom 2012
Sort
relevance
views
votes
recent
update
View
thumb
title
161
click to vote
CORR
2012
Springer
228
views
Education
»
more
CORR 2012
»
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
13 years 11 months ago
Download
www.cs.illinois.edu
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled
claim paper
Read More »
« Prev
« First
page 26 / 26
Last »
Next »