Dynamic graph stream algorithms in o(n) space

Huang, Z. and Peng, P. orcid.org/0000-0003-2700-5699 (2018) Dynamic graph stream algorithms in o(n) space. Algorithmica. ISSN 0178-4617



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
  • Accepted: 15 September 2018
  • Published (online): 25 September 2018
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: 11 Oct 2018 13:16
Published Version: https://doi.org/10.1007/s00453-018-0520-8
Status: Published online
Publisher: Springer Verlag
Refereed: Yes
Identification Number: https://doi.org/10.1007/s00453-018-0520-8

Share / Export