The following pages link to (Q5009503):
Displaying 5 items.
- Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) (← links)
- A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) (← links)
- (Q5091207) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- Almost optimal query algorithm for hitting set using a subset query (Q6113278) (← links)
