Fetching the paper…
Reading the bibliography…
SimRank is one of the most fundamental measures that evaluate the structural similarity between two nodes in a graph and has been applied in a plethora of data management tasks.
Probability inequalities for sums of bounded random variables
Wassily Hoeffding · 1994
Earlier work this paper cites.
The state of the art in distributed query processing
Donald Kossmann · 2000
Earlier work this paper cites.
Simrank: a measure of structural-context similarity
Glen Jeh and Jennifer Widom · 2002
Earlier work this paper cites.
Scaling link-based similarity search
Dániel Fogaras and Balázs Rácz · 2005
Earlier work this paper cites.
Link-based similarity search to fight web spam
András A Benczúr, Károly Csalogány, and Tamás Sarlós · 2006
Earlier work this paper cites.
The link-prediction problem for social networks
David Liben-Nowell and Jon Kleinberg · 2007
Earlier work this paper cites.
Simrank++: query rewriting through link analysis of the click graph
Ioannis Antonellis, Hector Garcia-Molina, and Chi-Chao Chang · 2008
Earlier work this paper cites.
S-simrank: Combining content and link information to cluster papers effectively and efficiently
Yuanzhe Cai, Pei Li, Hongyan Liu, Jun He, and Xiaoyong Du · 2008
Earlier work this paper cites.
Parallel simrank computation on large graphs with iterative aggregation
Guoming He, Haijun Feng, Cuiping Li, and Hong Chen · 2010
Earlier work this paper cites.
A model of computation for mapreduce
Howard Karloff, Siddharth Suri, and Sergei Vassilvitskii · 2010
Earlier work this paper cites.
Distributed computation in dynamic networks
Fabian Kuhn, Nancy Lynch, and Rotem Oshman · 2010
Earlier work this paper cites.
Axiomatic ranking of network role similarity
Ruoming Jin, Victor E. Lee, and Hui Hong · 2011
Earlier work this paper cites.
Sorting, searching, and simulation in the mapreduce framework
Michael T Goodrich, Nodari Sitchinava, and Qin Zhang · 2011
Earlier work this paper cites.
Sorting, searching, and simulation in the mapreduce framework
Michael T. Goodrich, Nodari Sitchinava, and Qin Zhang · 2011
Earlier work this paper cites.
On top-k structural similarity search
Pei Lee, Laks V. S. Lakshmanan, and Jeffrey Xu Yu · 2012
Earlier work this paper cites.
Disks: a system for distributed spatial group keyword search on road networks
Siqiang Luo, Yifeng Luo, Shuigeng Zhou, Gao Cong, and Jihong Guan · 2012
Earlier work this paper cites.
Efficient simrank-based similarity join over large graphs
Weiguo Zheng, Lei Zou, Yansong Feng, Lei Chen, and Dongyan Zhao · 2013
Earlier work this paper cites.
Efficient simrank computation via linearizationpublication of this article pending inquiry
Takanori Maehara, Mitsuru Kusumoto, and Ken-ichi Kawarabayashi · 2014
Earlier work this paper cites.
Scalable similarity search for simrank
Mitsuru Kusumoto, Takanori Maehara, and Ken-ichi Kawarabayashi · 2014
Earlier work this paper cites.
Parallel algorithms for geometric graph problems
Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak, and Grigory Yaroslavtsev · 2014
Earlier work this paper cites.
Distributed spatial keyword querying on road networks
Siqiang Luo, Yifeng Luo, Shuigeng Zhou, Gao Cong, Jihong Guan, and Zheng Yong · 2014
Cited alongside, same era.
Distributed computation of large-scale graph problems
Hartmut Klauck, Danupon Nanongkai, Gopal Pandurangan, and Peter Robinson · 2014
Cited alongside, same era.
An evaluation of simrank and personalized pagerank to build a recommender system for the web of data
Phuong Nguyen, Paolo Tomeo, Tommaso Di Noia, and Eugenio Di Sciascio · 2015
Cited alongside, same era.
Walking in the cloud: Parallel simrank at scale
Zhenguo Li, Yixiang Fang, Qin Liu, Jiefeng Cheng, Reynold Cheng, and John C. S. Lui · 2015
Cited alongside, same era.
An efficient similarity search framework for simrank over large dynamic graphs
Yingxia Shao, Bin Cui, Lei Chen, Mingming Liu, and Xing Xie · 2015
Cited alongside, same era.
Sling: A near-optimal index structure for simrank
Scaling graph neural networks with approximate pagerank
Aleksandar Bojchevski, Johannes Klicpera, Bryan Perozzi, Amol Kapoor, Martin Blais, Benedek Rózemberczki, Michal Lukasik, and Stephan Günnemann · 2020
Later among the works it cites.
DISK: A distributed framework for single-source simrank with accuracy guarantee
Yue Wang, Ruiqi Xu, Zonghao Feng, Yulin Che, Lei Chen, Qiong Luo, and Rui Mao · 2020
Later among the works it cites.
Exact single-source simrank computation on large graphs
Hanzhi Wang, Zhewei Wei, Ye Yuan, Xiaoyong Du, and Ji-Rong Wen · 2020
Later among the works it cites.
Realtime index-free single source simrank processing on web-scale graphs
Jieming Shi, Tianyuan Jin, Renchi Yang, Xiaokui Xiao, and Yin Yang · 2020
Later among the works it cites.
Improved mpc algorithms for mis, matching, and coloring on trees and beyond
Mohsen Ghaffari, Christoph Grunau, and Ce Jin · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Boyu Tian and Xiaokui Xiao · 2016
Cited alongside, same era.
Reads: a random walk approach for efficient and accurate dynamic simrank
Minhao Jiang, Ada Wai-Chee Fu, and Raymond Chi-Wing Wong · 2017
Cited alongside, same era.
An experimental evaluation of simrank-based similarity search algorithms
Zhipeng Zhang, Yingxia Shao, Bin Cui, and Ce Zhang · 2017
Cited alongside, same era.
Communication steps for parallel query processing
Paul Beame, Paraschos Koutris, and Dan Suciu · 2017
Cited alongside, same era.
Uniwalk: Unidirectional random walk based scalable simrank computation over large graph
Junshuai Song, Xiongcai Luo, Jun Gao, Chang Zhou, Hu Wei, and Jeffrey Xu Yu · 2018
Cited alongside, same era.
Improved massively parallel computation algorithms for mis, matching, and vertex cover
Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, and Ronitt Rubinfeld · 2018
Cited alongside, same era.
Matching and MIS for uniformly sparse graphs in the low-memory MPC model
Sebastian Brandt, Manuela Fischer, and Jara Uitto · 2018
Cited alongside, same era.
Massively parallel join algorithms
Xiao Hu and Ke Yi · 2020
Later among the works it cites.
Walking randomly, massively, and efficiently
Jakub Lacki, Slobodan Mitrovic, Krzysztof Onak, and Piotr Sankowski · 2020
Later among the works it cites.
Improved communication cost in distributed pagerank computation–a theoretical study
Siqiang Luo · 2020
Later among the works it cites.
Agenda: Robust personalized pageranks in evolving graphs
Dingheng Mo and Siqiang Luo · 2021
Later among the works it cites.
Exactsim: benchmarking single-source simrank algorithms with high-precision ground truths
Hanzhi Wang, Zhewei Wei, Yu Liu, Ye Yuan, Xiaoyong Du, and Ji-Rong Wen · 2021
Later among the works it cites.
Graph sparsification for derandomizing massively parallel computation with low space
Artur Czumaj, Peter Davies, and Merav Parter · 2021
Later among the works it cites.
Dynamic graph algorithms with batch updates in the massively parallel computation model
Krzysztof Nowicki and Krzysztof Onak · 2021
Later among the works it cites.
Massively parallel algorithms for distance approximation and spanners
Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrović, and Yasamin Nazari · 2021
Later among the works it cites.
Two-attribute skew free, isolated CP theorem, and massively parallel joins
Miao Qiao and Yufei Tao · 2021
Later among the works it cites.
Cover or pack: New upper and lower bounds for massively parallel joins
Xiao Hu · 2021
Later among the works it cites.
SCARA: scalable graph neural networks with feature-oriented optimization
Ningyi Liao, Dingheng Mo, Siqiang Luo, Xiang Li, and Pengcheng Yin · 2022
Later among the works it cites.
Massively parallel algorithms for b-matching
Mohsen Ghaffari, Christoph Grunau, and Slobodan Mitrović · 2022
Later among the works it cites.
Parallel acyclic joins with canonical edge covers
Yufei Tao · 2022
Later among the works it cites.
Distributed pagerank computation with improved round complexities
Siqiang Luo, Xiaowei Wu, and Ben Kao · 2022
Later among the works it cites.
Multi-task processing in vertex-centric graph systems: Evaluations and insights
Siqiang Luo, Zichen Zhu, Xiaokui Xiao, Yin Yang, Chunbo Li, and Ben Kao · 2023
Closest in time.