Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time
- Submitting institution
-
University of Bristol
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 95855894
- Type
- E - Conference contribution
- DOI
-
10.1109/FOCS.2015.24
- Title of conference / published proceedings
- 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
- First page
- 250
- Volume
- -
- Issue
- -
- ISSN
- 0272-5428
- Open access status
- Out of scope for open access requirements
- Month of publication
- October
- Year of publication
- 2015
- 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)
-
D - Fundamentals of Computing
- Citation count
- 15
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper appeared at FOCS prior to full publication in SICOMP. The paper gives a near-linear time algorithm for linear graph sparsification, a highly important problem arising in handling large networks. This is dramatically faster than all previously-known algorithms. It has attracted considerable interest from the community, and the methods introduced have been instrumental in further recent advances in the field [Abraham etc. FOCS ’16; Cohen etc. FOCS’16; Lee etc. STOC’17; Fung etc. SICOMP’2019]. It contributed to He Sun being selected as a Turing Fellow at Alan Turing Institute.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -