Independent Sets in Vertex-Arrival Streams
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 223605502
- Type
- E - Conference contribution
- DOI
-
10.4230/LIPIcs.ICALP.2019.45
- Title of conference / published proceedings
- 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
- First page
- 1
- Volume
- -
- Issue
- -
- ISSN
- 1868-8969
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2019
- 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
-
2
- Research group(s)
-
D - Fundamentals of Computing
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- We study how the space requirements for solving Maximum Independent Set depends on the arrival order of edges in the data streaming model. We prove that the so-called vertex-arrival order assumption does not yield significant advantages over the worst-case edge-arrival order assumption. This is surprising since many other problems, including Maximal Independent Set and Maximum Matching, are much easier to solve in the vertex-arrival model. To obtain our lower bound results, we introduce a new communication problem denoted Chained Index. This problem has since been proved useful in other contexts, such as submodular maximization [Feldman et al. STOC 2020].
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -