Nearly optimal local algorithms for constructing sparse spanners of clusterable graphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7075933 (Why is no real title available?)
- scientific article; zbMATH DE number 7376014 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- A Local Computation Approximation Scheme to Maximum Matching
- A local algorithm for constructing spanners in minor-free graphs
- A quasi-polynomial time partition oracle for graphs with an excluded minor
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Best of two local models: centralized local and distributed local algorithms
- Can we locally compute sparse connected subgraphs?
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Constructing near spanning trees with few local inspections
- Converting online algorithms to local computation algorithms
- Decomposing a graph into expanding subgraphs
- Expander graphs and their applications
- Improved local computation algorithms for constructing spanners
- Local algorithms for sparse spanning graphs
- Local algorithms for sparse spanning graphs
- Local computation algorithms for graphs of non-constant degrees
- Local computation algorithms for spanners
- Partitioning into expanders
- Robust Clustering Oracle and Local Reconstructor of Cluster Structure of Graphs
- Space-efficient local computation algorithms
- Spanning adjacency oracles in sublinear time
- Testing Hamiltonicity (And Other Problems) in Minor-Free Graphs
- Testing cluster structure of graphs
This page was built for publication: Nearly optimal local algorithms for constructing sparse spanners of clusterable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920777)
