WebGraph

swMATH30097MaRDI QIDQ41811FDOQ41811

Author name not available (Why is that?)

Cited In (51)

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

This page was built for software: WebGraph