The following pages link to WebGraph (Q41811):
Displaying 50 items.
- Strong articulation points and strong bridges in large scale graphs (Q270023) (← links)
- An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC (Q275525) (← links)
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis (Q312468) (← links)
- Compact binary relation representations with rich functionality (Q386006) (← links)
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- Optimizing \(K^2\) trees: a case for validating the maturity of network of practices (Q418346) (← links)
- Practical acceleration for computing the HITS expertrank vectors (Q442725) (← links)
- Efficient fully-compressed sequence representations (Q472482) (← links)
- Tight and simple web graph compression for forward and reverse neighbor queries (Q496546) (← links)
- Multiscale approach for the network compression-friendly ordering (Q553960) (← links)
- Faster compression methods for a weighted graph using locality sensitive hashing (Q780991) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- Set-based approximate approach for lossless graph summarization (Q904121) (← links)
- Main-memory triangle computations for very large (sparse (power-law)) graphs (Q955020) (← links)
- Choose the damping, choose the ranking? (Q972362) (← links)
- Off-diagonal low-rank preconditioner for difficult PageRank problems (Q1624665) (← links)
- Typical distances in the directed configuration model (Q1661569) (← links)
- Geometric inhomogeneous random graphs (Q1713405) (← links)
- An efficient elimination strategy for solving PageRank problems (Q1735084) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- Graph summarization with quality guarantees (Q1741300) (← links)
- Second order accurate distributed eigenvector computation for extremely large matrices (Q1952103) (← links)
- Compact structure for sparse undirected graphs based on a clique graph partition (Q2054100) (← links)
- Greedy routing and the algorithmic small-world phenomenon (Q2071825) (← links)
- Adaptive succinctness (Q2118203) (← links)
- I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs (Q2293164) (← links)
- Regularization-based solution of the PageRank problem for large matrices (Q2393054) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- Steady-state analysis of google-like stochastic matrices with block iterative methods (Q2447346) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Reachability preserving compression for dynamic graph (Q2660982) (← links)
- Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors (Q2668354) (← links)
- A practical succinct dynamic graph representation (Q2672244) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- Complex Network Partitioning Using Label Propagation (Q2830633) (← links)
- Graph fibrations, graph isomorphism, and PageRank (Q3431437) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- Fast Quasi-Threshold Editing (Q3452790) (← links)
- Perturbed Iterate Analysis for Asynchronous Stochastic Optimization (Q4588862) (← links)
- Summarizing and understanding large graphs (Q4970005) (← links)
- Quick Detection of Nodes with Large Degrees (Q4985346) (← links)
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees (Q4985358) (← links)
- Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees (Q4985779) (← links)
- Sampling Geometric Inhomogeneous Random Graphs in Linear Time (Q5111706) (← links)
- Algorithm 1003 (Q5132310) (← links)
- Fast Construction of Compressed Web Graphs (Q5150926) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- Learning the Structural Vocabulary of a Network (Q5380644) (← links)
