Pages that link to "Item:Q5002838"
From MaRDI portal
The following pages link to On the Complexity of Sampling Vertices Uniformly from a Graph (Q5002838):
Displaying 9 items.
- A fair-cost analysis of the random neighbor sampling method (Q2086576) (← links)
- Interactive proofs for social graphs (Q2102081) (← links)
- Scalable Uniform Graph Sampling by Local Computation (Q3006147) (← links)
- Uniform random sampling of planar graphs in linear time (Q3055787) (← links)
- Sampling to provide or to bound: With applications to fully dynamic graph algorithms (Q4372787) (← links)
- Tight Bounds on Vertex Connectivity Under Sampling (Q4962652) (← links)
- On random sampling in uniform hypergraphs (Q5198663) (← links)
- On Sampling Edges Almost Uniformly (Q5240421) (← links)
- How large is your graph? (Q6487507) (← links)