107 search results - page 22 / 22 » On the K-simple shortest paths problem in weighted directed ... |
CIKM
2007
Springer
13 years 10 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
KDD
2010
ACM
13 years 10 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...