Cited in
(81)- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs
- Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors
- Steady-state analysis of google-like stochastic matrices with block iterative methods
- GLOUDS: representing tree-like graphs
- LiveRank: how to refresh old datasets
- Reachability preserving compression for dynamic graph
- Entropy of some models of sparse random graphs with vertex-names
- Quick detection of nodes with large degrees
- Summarizing and understanding large graphs
- Second order accurate distributed eigenvector computation for extremely large matrices
- Strong articulation points and strong bridges in large scale graphs
- (Nearly-)tight bounds on the contiguity and linearity of cographs
- Tight and simple web graph compression for forward and reverse neighbor queries
- An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- Graph fibrations, graph isomorphism, and PageRank
- Typical distances in the directed configuration model
- Regularization-based solution of the PageRank problem for large matrices
- An efficient elimination strategy for solving PageRank problems
- Sampling geometric inhomogeneous random graphs in linear time
- Compact structure for sparse undirected graphs based on a clique graph partition
- Adaptive succinctness
- A practical succinct dynamic graph representation
- Multiscale approach for the network compression-friendly ordering
- Learning the structural vocabulary of a network
- Faster compression methods for a weighted graph using locality sensitive hashing
- Compact binary relation representations with rich functionality
- Linearity is strictly more powerful than contiguity for encoding graphs
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
- On the power of simple reductions for the maximum independent set problem
- Set-based approximate approach for lossless graph summarization
- Algorithm 1003: Mongoose, a graph coarsening and partitioning library
- Parallel maximum clique algorithms with applications to network analysis
- Off-diagonal low-rank preconditioner for difficult PageRank problems
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Pajek datasets
- SNAP
- MCSTL
- STXXL
- ANF
- Graphs
- MetExplore
- TopoLayout
- Pregel
- UbiCrawler
- UMPa
- bvgraph
- KONECT
- PEGASUS
- MatlabBGL
- Fast construction of compressed web graphs
- Approximation algorithms in combinatorial scientific computing
- On computing the diameter of real-world undirected graphs
- KronFit
- PARTY
- Matchbox
- FANMOD
- GeneRank
- BUbiNG
- DOULION
- fast-ppr
- Kaskade
- Ligra
- GraphChi
- Efficient fully-compressed sequence representations
- NetworKit
- Mongoose
- BSPedupack
- OddBall
- Greedy routing and the algorithmic small-world phenomenon
- Choose the damping, choose the ranking?
- Perturbed iterate analysis for asynchronous stochastic optimization
- Complex network partitioning using label propagation
- An efficient exact algorithm for triangle listing in large graphs
- Graph summarization with quality guarantees
- Geometric inhomogeneous random graphs
- Practical acceleration for computing the HITS expertrank vectors
- Main-memory triangle computations for very large (sparse (power-law)) graphs
- Degree-degree dependencies in directed networks with heavy-tailed degrees
- Fast quasi-threshold editing
This page was built for software: WebGraph
