Huang, Z. and Peng, P. orcid.org/0000-0003-2700-5699 (2019) Dynamic graph stream algorithms in o(n) space. Algorithmica, 81 (5). pp. 1965-1987. ISSN 0178-4617
Abstract
In this paper we study graph problems in the dynamic streaming model, where the input is defined by a sequence of edge insertions and deletions. As many natural problems require Ω(n) space, where n is the number of vertices, existing works mainly focused on designing O(n⋅polylogn) space algorithms. Although sublinear in the number of edges for dense graphs, it could still be too large for many applications (e.g., n is huge or the graph is sparse). In this work, we give single-pass algorithms beating this space barrier for two classes of problems. We present o(n) space algorithms for estimating the number of connected components with additive error εn of a general graph and (1+ε) -approximating the weight of the minimum spanning tree of a connected graph with bounded edge weights, for any small constant ε>0 . The latter improves upon the previous O(n⋅polylogn) space algorithm given by Ahn et al. (SODA 2012) for the same class of graphs. We initiate the study of approximate graph property testing in the dynamic streaming model, where we want to distinguish graphs satisfying the property from graphs that are ε -far from having the property. We consider the problem of testing k-edge connectivity, k-vertex connectivity, cycle-freeness and bipartiteness (of planar graphs), for which, we provide algorithms using roughly O(n1−ε⋅polylogn) space, which is o(n) for any constant ε . To complement our algorithms, we present Ω(n1−O(ε)) space lower bounds for these problems, which show that such a dependence on ε is necessary.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © The Author(s) 2018. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. |
Keywords: | Dynamic graph streams; Graph sketching; Property testing; Minimum spanning tree |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 10 Sep 2018 11:28 |
Last Modified: | 10 May 2024 10:51 |
Status: | Published |
Publisher: | Springer Verlag |
Refereed: | Yes |
Identification Number: | 10.1007/s00453-018-0520-8 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:135474 |
Download
Filename: Huang-Peng2018_Article_DyNamicGraphStreamAlgOrithmsIN.pdf
Licence: CC-BY 4.0