Memory-aware framework for fast and scalable second-order random walk over billion-edge natural graphs

Authors:

Publisher website

7 May 2021

journal article
research article
Published by Springer Nature in The VLDB Journal

Vol. 30 (5) , 769-797
DOI:10.1007/s00778-021-00669-2

Abstract

No abstract available

Keywords

Funding Information

National Natural Science Foundation of China (61702015, U1936104)
National Natural Science Foundation of China (61832001)
National Natural Science Foundation of China (61729201)

This publication has 44 references indexed in Scilit:

Main-memory triangle computations for very large (sparse (power-law)) graphs
Theoretical Computer Science, 2008
Multi-Label Classification
International Journal of Data Warehousing and Mining, 2007
Component‐based iterative methods for sparse linear systems
Concurrency and Computation: Practice and Experience, 2006
Probability and random processes (3rd edn)
The Mathematical Gazette, 2002
A minimal algorithm for the multiple-choice knapsack problem
European Journal of Operational Research, 1995
Exact methods for the knapsack problem and its generalizations
European Journal of Operational Research, 1987
The Linear Multiple Choice Knapsack Problem
Operations Research, 1980
The Multiple-Choice Knapsack Problem
Operations Research, 1979
An Efficient Method for Generating Discrete Random Variables with General Distributions
ACM Transactions on Mathematical Software, 1977
Generating discrete random variables in a computer
Communications of the ACM, 1963