Near uniform triangle sampling over adjacency list graph streams

Cites work

A hybrid sampling scheme for triangle counting
A second look at counting triangles in graph streams
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling
Almost optimal bounds for sublinear-time sampling of k-cliques in bounded arboricity graphs
An Optimal Algorithm for Triangle Counting in the Stream
Colorful triangle counting and a \textsc{MapReduce} implementation
Communication lower bounds using directional derivatives
Computing and Combinatorics
Concentration of Measure for the Analysis of Randomized Algorithms
Counting arbitrary subgraphs in data streams
Counting cycles and finite dimensional \(L^{p}\) norms
Data streams: algorithms and applications.
Edge sampling and graph parameter estimation via vertex neighborhood accesses
Efficient triangle counting in large graphs via degree-based vertex partitioning
Finding and counting given length cycles
How hard is counting triangles in the streaming model?
scientific article; zbMATH DE number 6862103 (Why is no real title available?)
scientific article; zbMATH DE number 2119719 (Why is no real title available?)
On sampling edges almost uniformly
Random Sampling and Size Estimation Over Cyclic Joins.
Random sampling with a reservoir
Sampling an edge in sublinear time exactly and optimally
Sampling arbitrary subgraphs exactly uniformly in sublinear time
Structural tractability of counting of solutions to conjunctive queries
The logic of counting query answers
The sketching complexity of graph and hypergraph counting
Towards a Decomposition-Optimal Algorithm for Counting and Sampling Arbitrary Motifs in Sublinear Time
Triangle counting in dynamic graph streams
When is approximate counting for conjunctive queries tractable?

This page was built for publication: Near uniform triangle sampling over adjacency list graph streams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294925)