Efficient Spectral Algorithms for Massive and Dynamic Graphs

Project Details

StatusActive
Effective start/end date1/01/2031/12/24

Funding

  • EPSRC: £1,507,132.00

Fingerprint

Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
  • Fast and Simple Spectral Clustering in Theory and Practice

    Macgregor, P., 15 Dec 2023, 37th Conference on Neural Information Processing Systems (NeurIPS 2023). Curran Associates Inc, Vol. 36. p. 34410-34425 16 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
  • Fast Approximation of Similarity Graphs with Kernel Density Estimation

    Macgregor, P. & Sun, H., 15 Dec 2023, 37th Conference on Neural Information Processing Systems (NeurIPS 2023). Curran Associates Inc, Vol. 36. p. 67603-67624 22 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File
  • Is the Algorithmic Kadison-Singer Problem Hard?

    Jourdan, B., Macgregor, P. & Sun, H., 28 Nov 2023, 34th International Symposium on Algorithms and Computation (ISAAC 2023). Iwata, S. & Kakimura, N. (eds.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 283. p. 1-18 18 p. 43. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    File