Improved 3-pass Algorithm for Counting 4-cycles in Arbitrary Order Streaming

07/27/2020
by   Sofya Vorotnikova, et al.
0

The problem of counting small subgraphs, and specifically cycles, in the streaming model received a lot of attention over the past few years. In this paper, we consider arbitrary order insertion-only streams, improving over the state-of-the-art result on counting 4-cycles. Our algorithm computes a (1+ϵ)-approximation by taking three passes over the stream and using space O(m log n/ϵ^2 T^1/3), where m is the number of edges in the graph and T is the number of 4-cycles.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/27/2022

Approximately Counting Subgraphs in Data Streams

Estimating the number of subgraphs in data streams is a fundamental prob...
research
09/07/2020

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems

Consider the following gap cycle counting problem in the streaming model...
research
03/17/2022

Triangle and Four Cycle Counting with Predictions in Graph Streams

We propose data-driven one-pass streaming algorithms for estimating the ...
research
05/03/2021

Model Counting meets F0 Estimation

Constraint satisfaction problems (CSP's) and data stream models are two ...
research
01/29/2018

ONCE and ONCE+: Counting the Frequency of Time-constrained Serial Episodes in a Streaming Sequence

As a representative sequential pattern mining problem, counting the freq...
research
12/24/2019

Counting the geodesic cycles of a given length

Assume that X is a connected regular undirected graph of finite order n....
research
12/08/2018

Counting Butterfies from a Large Bipartite Graph Stream

We consider the estimation of properties on massive bipartite graph stre...

Please sign up or login with your details

Forgot password? Click here to reset