Approximating the Arboricity in Sublinear Time

by   Talya Eden, et al.

We consider the problem of approximating the arboricity of a graph G= (V,E), which we denote by 𝖺𝗋𝖻(G), in sublinear time, where the arboricity of a graph is the minimal number of forests required to cover its edges. An algorithm for this problem may perform degree and neighbor queries, and is allowed a small error probability. We design an algorithm that outputs an estimate Ξ±Μ‚, such that with probability 1-1/poly(n), 𝖺𝗋𝖻(G)/clog^2 n ≀α̂≀𝖺𝗋𝖻(G), where n=|V| and c is a constant. The expected query complexity and running time of the algorithm are O(n/𝖺𝗋𝖻(G))Β·poly(log n), and this upper bound also holds with high probability. poly(log n) dependencies). This bound is optimal for such an approximation up to a poly(log n) factor.


page 1

page 2

page 3

page 4

βˆ™ 10/03/2022

Local Computation of Maximal Independent Set

We present a randomized Local Computation Algorithm (LCA) with query com...
βˆ™ 05/15/2023

Sparsifying Sums of Norms

For any norms N_1,…,N_m on ℝ^n and N(x) := N_1(x)+β‹―+N_m(x), we show ther...
βˆ™ 01/13/2023

Sublinear Algorithms for TSP via Path Covers

We study sublinear time algorithms for the traveling salesman problem (T...
βˆ™ 10/23/2022

Sublinear-Time Algorithms for Max Cut, Max E2Lin(q), and Unique Label Cover on Expanders

We show sublinear-time algorithms for Max Cut and Max E2Lin(q) on expand...
βˆ™ 04/04/2019

Sublinear quantum algorithms for training linear and kernel-based classifiers

We investigate quantum algorithms for classification, a fundamental prob...
βˆ™ 07/26/2021

Approximating Sumset Size

Given a subset A of the n-dimensional Boolean hypercube 𝔽_2^n, the sumse...
βˆ™ 02/24/2020

Upper Tail Analysis of Bucket Sort and Random Tries

Bucket Sort is known to run in expected linear time when the input keys ...

Please sign up or login with your details

Forgot password? Click here to reset