Universally optimal streaming algorithm for random walks in dense graphs
From MaRDI portal
Cites work
- A local clustering algorithm for massive graphs and its application to nearly linear time graph partitioning
- A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
- An almost-linear time algorithm for uniform random spanning tree generation
- An automatic inequality prover and instance optimal identity testing
- Approximating the Permanent
- Better streaming algorithms for clustering problems
- Beyond the Worst-Case Analysis of Algorithms
- Estimating PageRank on graph streams
- Factorial lower bounds for (almost) random order streams
- Finding sparse cuts locally using evolving sets
- Instance-optimal geometric algorithms
- Near-optimal two-pass streaming algorithm for sampling random walks over directed graphs
- Optimal aggregation algorithms for middleware.
- Random generation of combinatorial structures from a uniform distribution
- Random sampling with a reservoir
- Simulating random walks in random streams
- Simulating random walks on graphs in the streaming model
- Sublinear algorithms for MAXCUT and correlation clustering
- Three theorems regarding testing graph properties
- Undirected connectivity in log-space
- Using PageRank to Locally Partition a Graph
This page was built for publication: Universally optimal streaming algorithm for random walks in dense graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445577)