WebGraph

swMATH30097MaRDI QIDQ41811

No author found.

Related Items (53)

Strong articulation points and strong bridges in large scale graphs ⋮ An efficient Monte Carlo approach to compute PageRank for large graphs on a single PC ⋮ Linearity is strictly more powerful than contiguity for encoding graphs ⋮ Off-diagonal low-rank preconditioner for difficult PageRank problems ⋮ Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ Fast Quasi-Threshold Editing ⋮ Projection algorithms for nonconvex minimization with application to sparse principal component analysis ⋮ GLOUDS: representing tree-like graphs ⋮ Regularization-based solution of the PageRank problem for large matrices ⋮ Typical distances in the directed configuration model ⋮ Finding near-optimal independent sets at scale ⋮ Reachability preserving compression for dynamic graph ⋮ Shifted power-GMRES method accelerated by extrapolation for solving pagerank with multiple damping factors ⋮ Compact binary relation representations with rich functionality ⋮ On computing the diameter of real-world undirected graphs ⋮ A practical succinct dynamic graph representation ⋮ (Nearly-)tight bounds on the contiguity and linearity of cographs ⋮ Perturbed Iterate Analysis for Asynchronous Stochastic Optimization ⋮ Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover ⋮ Optimizing \(K^2\) trees: a case for validating the maturity of network of practices ⋮ Set-based approximate approach for lossless graph summarization ⋮ Second order accurate distributed eigenvector computation for extremely large matrices ⋮ Practical acceleration for computing the HITS expertrank vectors ⋮ Geometric inhomogeneous random graphs ⋮ Learning the Structural Vocabulary of a Network ⋮ Algorithm 1003 ⋮ Steady-state analysis of google-like stochastic matrices with block iterative methods ⋮ Efficient fully-compressed sequence representations ⋮ An efficient elimination strategy for solving PageRank problems ⋮ Tight and simple web graph compression for forward and reverse neighbor queries ⋮ Fast Construction of Compressed Web Graphs ⋮ An efficient exact algorithm for triangle listing in large graphs ⋮ Graph summarization with quality guarantees ⋮ Main-memory triangle computations for very large (sparse (power-law)) graphs ⋮ ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES ⋮ Quick Detection of Nodes with Large Degrees ⋮ Choose the damping, choose the ranking? ⋮ Multiscale approach for the network compression-friendly ordering ⋮ I/O-efficient calculation of \(H\)-group closeness centrality over disk-resident graphs ⋮ Fast and compact planar embeddings ⋮ Summarizing and understanding large graphs ⋮ Compact structure for sparse undirected graphs based on a clique graph partition ⋮ On the Power of Simple Reductions for the Maximum Independent Set Problem ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Complex Network Partitioning Using Label Propagation ⋮ Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees ⋮ Degree-Degree Dependencies in Directed Networks with Heavy-Tailed Degrees ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Faster compression methods for a weighted graph using locality sensitive hashing ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time ⋮ LiveRank: How to Refresh Old Datasets ⋮ Graph fibrations, graph isomorphism, and PageRank ⋮ Adaptive succinctness

This page was built for software: WebGraph