Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

81

SIGMOD
2010
ACM

186views Database» more SIGMOD 2010»

TEDI: efficient shortest path query answering on graphs

15 years 2 months ago

TEDI: efficient shortest path query answering on graphs

Download www.informatik.uni-freiburg.de

Fang Wei

Real-time Traffic

Database | SIGMOD 2010 |

claim paper

Related Content

» Efficient Query Processing in Large Traffic Networks

» Finding timedependent shortest paths over large graphs

» Answering pattern match queries in large graph databases via graph embedding

» Visiting a Polygon on the Optimal Way to a Query Point

» Shortest path problem in rectangular complexes of global nonpositive curvature

» External Data Structures for Shortest Path Queries on Planar Digraphs

» Optimization and evaluation of shortest path queries

» An External Memory Data Structure for Shortest Path Queries

» Approximate Shortest Path Queries Using Voronoi Duals

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	SIGMOD
Authors	Fang Wei

Comments (0)