Sciweavers

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

5

EDBT
2009
ACM

favoriteEmaildiscussreport

100views Database» more EDBT 2009»

Efficiently indexing shortest paths by exploiting symmetry in graphs

13 years 8 months ago

Efficiently indexing shortest paths by exploiting symmetry in graphs

Download homepage.fudan.edu.cn

Yanghua Xiao, Wentao Wu, Jian Pei, Wei Wang 0009,

Real-time Traffic

Database | EDBT 2009 |

claim paper

Related Content

» Exploiting Local Similarity for Indexing Paths in GraphStructured Data

» MQuery Fast Graph Query via Semantic Indexing for Mobile Context

» An Efficient Graph Cut Algorithm for Computer Vision Problems

» HyperANF Approximating the Neighbourhood Function of Very Large Graphs on a Budget

» Exploring networks with traceroutelike probes theory and simulations

Post Info
More Details (n/a)

Added	16 Aug 2010
Updated	16 Aug 2010
Type	Conference
Year	2009
Where	EDBT
Authors	Yanghua Xiao, Wentao Wu, Jian Pei, Wei Wang 0009, Zhenying He

Comments (0)