Pages that link to "Item:Q3514701"
From MaRDI portal
The following pages link to Approximating average parameters of graphs (Q3514701):
Displayed 31 items.
- A lower bound for metric 1-median selection (Q340556) (← links)
- Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- On triangle estimation using tripartite independent set queries (Q825973) (← links)
- Spreading messages (Q1029342) (← links)
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- On Las Vegas approximations for metric 1-median selection (Q1739219) (← links)
- Comparing the strength of query types in property testing: the case of \(k\)-colorability (Q1947037) (← links)
- Motif estimation via subgraph sampling: the fourth-moment phenomenon (Q2131263) (← links)
- Estimating the number of connected components in a graph via subgraph sampling (Q2174974) (← links)
- On ultrametric 1-median selection (Q2182656) (← links)
- Bootstrap estimators for the tail-index and for the count statistics of graphex processes (Q2219229) (← links)
- Deterministic metric 1-median selection with A \(1-o(1)\) fraction of points ignored (Q2695287) (← links)
- Introduction to Testing Graph Properties (Q3088198) (← links)
- Approximately Counting Triangles in Sublinear Time (Q4593251) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Introduction to Testing Graph Properties (Q4933365) (← links)
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- (Q4993304) (← links)
- On the Complexity of Sampling Vertices Uniformly from a Graph (Q5002838) (← links)
- (Q5009503) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- (Q5091015) (← links)
- (Q5091207) (← links)
- Quantum Chebyshev's Inequality and Applications (Q5091227) (← links)
- On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) (← links)
- On Sampling Edges Almost Uniformly (Q5240421) (← links)
- (Q5743463) (← links)
- Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter (Q6051928) (← links)
- Vector-Matrix-Vector Queries for Solving Linear Algebra, Statistics, and Graph Problems (Q6062149) (← links)
- Almost optimal query algorithm for hitting set using a subset query (Q6113278) (← links)