Dynamic Graph Stream Algorithms in o(n) Space
- Submitting institution
-
The University of Sheffield
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2507
- Type
- D - Journal article
- DOI
-
10.1007/s00453-018-0520-8
- Title of journal
- Algorithmica
- Article number
- -
- First page
- 1965
- Volume
- 81
- Issue
- 5
- ISSN
- 0178-4617
- Open access status
- Compliant
- Month of publication
- September
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
A - Algorithms
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Determining which graph problems can be solved in sublinear (o(n)) space in the data stream model has been an open problem (see McGregor’s influential survey doi.org/10.1145/2627692.2627694). We show for the first time that two fundamental classes of graph problems can be solved in o(n) space in a single-pass in the dynamic streaming model. The paper has led to new collaboration with Prof. S. Muthukrishna, a world-leading expert on data streaming algorithms. The paper was described as "pioneering work" in a FOCS 2020 paper https://www.cs.princeton.edu/~hy2/files/stream_cycle.pdf by researchers from Princeton University and Rutgers University.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -