The following pages link to (Q5743463):
Displaying 19 items.
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- A simple LP-free approximation algorithm for the minimum weight vertex cover problem (Q673599) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Best of two local models: centralized local and distributed local algorithms (Q1784947) (← links)
- (Q3641922) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- (Q5091015) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
- Approximation of Self-stabilizing Vertex Cover Less Than 2 (Q5307040) (← links)
- Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems (Q6062149) (← links)
- Approximating the distance to monotonicity of Boolean functions (Q6074683) (← links)
- On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions (Q6076351) (← links)
- Almost optimal query algorithm for hitting set using a subset query (Q6113278) (← links)
- Sublinear time approximation of the cost of a metric \(k\)-nearest neighbor graph (Q6491305) (← links)
