Improved sampling with applications to dynamic graph algorithms
From MaRDI portal
Recommendations
- Sampling to provide or to bound: With applications to fully dynamic graph algorithms
- scientific article; zbMATH DE number 1263228
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- scientific article; zbMATH DE number 910887
- Average-case analysis of dynamic graph algorithms
Cited in
(6)- Randomization for efficient dynamic graph algorithms (invited talk)
- Scalable Uniform Graph Sampling by Local Computation
- Sampling to provide or to bound: With applications to fully dynamic graph algorithms
- Maintaining minimum spanning trees in dynamic graphs
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
- Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
This page was built for publication: Improved sampling with applications to dynamic graph algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818842)