📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Sublinear Time Approximation of the Cost of a Metric \({k}\)-Nearest Neighbor Graph (2024)

First Author: Czumaj A

Attributed to: Sublinear Algorithms for Big Graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/22m1544105

Publication URI: http://dx.doi.org/10.1137/22m1544105

Type: Journal Article/Review

Parent Publication: SIAM Journal on Computing

Issue: 2