Pages that link to "Item:Q6051991"
From MaRDI portal
The following pages link to Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs (Q6051991):
Displaying 4 items.
- Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) (← links)
- Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms (Q3503606) (← 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)