Fast and accurate estimation of shortest paths in large graphs (2010)

by Andrey Gubichev , Srikanta Bedathur , Stephan Seufert , Gerhard Weikum
Venue:In Proceedings of Conference on Information and Knowledge Management (CIKM
Citations:9 - 0 self

Active Bibliography

1 I/O Cost Minimization: Reachability Queries Processing over Massive Graphs – Zhiwei Zhang, Qing Zhu, Jeffrey Xu Yu, Xiaofang Zhou, Lu Qin
Efficient Graph Reachability Query Answering using Tree Decomposition – Fang Wei
Simple, Fast, and Scalable Reachability Oracle – Ruoming Jin, Guan Wang
Evaluating Queries over Route Collections – Panagiotis Bouros - 2011
FERRARI: Flexible and Efficient Reachability Range Assignment for Graph Indexing – Stephan Seufert, Avishek An, Srikanta Bedathur, Gerhard Weikum
1 TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph – James Cheng, Silu Huang, Huanhuan Wu, Ada Wai-chee Fu
8 An Optimal Labeling Scheme for Workflow Provenance Using Skeleton Labels – Zhuowei Bao, Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy
3 K-reach: Who is in your small world – James Cheng, Haixun Wang, Zechao Shang, Jeffrey Xu Yu, Hong Cheng
Answering Label-Constraint Reachability in Large Graphs – Kun Xu, Lei Zou, Jeffrey Xu Yu, Lei Chen, Yanghua Xiao, Dongyan Zhao - 2011
BMC: An Efficient Method to Evaluate Probablistic Reachability Queries – Ke Zhu, Wenjie Zhang, Gaoping Zhu, Ying Zhang, Xuemin Lin
DAGGER: A Scalable Index for Reachability Queries in Large Dynamic Graphs – Hilmi Yildirim, Vineet Chaoji, Mohammed J. Zaki - 1301
4 GRAPH DATA MANAGEMENT AND MINING: A SURVEY OF ALGORITHMS AND APPLICATIONS – Charu C. Aggarwal, Haixun Wang - 2010
38 Managing and Mining Graph Data – Charu C. Aggarwal, Haixun Wang
2 IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying – Ada Wai-chee Fu, Huanhuan Wu, James Cheng
On Incremental Maintenance of 2-hop Labeling of Graphs – Ramadhana Bram, Byron Choi, Wee Keong Ng
4 Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs – Konstantin Tretyakov, Jaak Vilo, Abel Armas-cervantes, Marlon Dumas, Luciano García-bañuelos - 2011
2 Shortest paths in less than a millisecond – Rachit Agarwal, Matthew Caesar, Ben Y. Zhao, P. Brighten Godfrey - 2012
Shortest Paths in Microseconds – Rachit Agarwal, Matthew Caesar, Ben Y. Zhao, P. Brighten Godfrey
Atlas: Approximating Shortest Paths in Social Graphs – Lili Cao, Xiaohan Zhao, Haitao Zheng, Ben Y. Zhao