Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs
Data Structures and Algorithms
2023-05-29 v1 Databases
Abstract
In this paper, we design sub-linear space streaming algorithms for estimating three fundamental parameters -- maximum independent set, minimum dominating set and maximum matching -- on sparse graph classes, i.e., graphs which satisfy where is the number of edges, vertices respectively. Each of the three graph parameters we consider can have size even on sparse graph classes, and hence for sublinear-space algorithms we are restricted to parameter estimation instead of attempting to find a solution.
Cite
@article{arxiv.2305.16815,
title = {Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs},
author = {Xiuge Chen and Rajesh Chitnis and Patrick Eades and Anthony Wirth},
journal= {arXiv preprint arXiv:2305.16815},
year = {2023}
}