Cover Image

Embedding Graphs as Euclidean kNN-Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Schibler, T., Suri, S., Xue, J.
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approximation and Hardness of Polychromatic TSP
by: Schibler, Thomas, et al.
Published: (2025)

Approximating Convex Hulls via Range Queries
by: Schibler, T., et al.
Published: (2026)

Batch Normalization in Cytometry Data by kNN-Graph Preservation
by: Battikh, Muhammad S., et al.
Published: (2023)

Manifold k-NN: Accelerated k-NN Queries for Manifold Point Clouds
by: Wang, Pengfei, et al.
Published: (2026)

kNN-Graph: An adaptive graph model for $k$-nearest neighbors
by: Li, Jiaye, et al.
Published: (2026)

Vietoris--Rips Shadow for Euclidean Graph Reconstruction
by: Komendarczyk, Rafal, et al.
Published: (2025)

kNN Classification of Malware Data Dependency Graph Features
by: Musgrave, John, et al.
Published: (2024)

The Euclidean $k$-Matching Problem is NP-hard
by: Díaz-Báñez, José-Miguel, et al.
Published: (2025)

Generating Diverse Translation with Perturbed kNN-MT
by: Nishida, Yuto, et al.
Published: (2024)

Min-$k$-planar Drawings of Graphs
by: Binucci, Carla, et al.
Published: (2023)

On connections between k-coloring and Euclidean k-means
by: Aman, Enver, et al.
Published: (2024)

Morse Theory for the k-NN Distance Function
by: Reani, Yohai, et al.
Published: (2024)

Euclidean k-center Fair Clusterings
by: Moritaka, Ayano, et al.
Published: (2025)

kNN For Whisper And Its Effect On Bias And Speaker Adaptation
by: Nachesa, Maya K., et al.
Published: (2024)

Faster Approximation Scheme for Euclidean $k$-TSP
by: van Wijland, Ernest, et al.
Published: (2023)

Pathwidth of 2-Layer $k$-Planar Graphs
by: Okada, Yuto
Published: (2025)

Routing by Analogy: kNN-Augmented Expert Assignment for Mixture-of-Experts
by: Lyu, Boxuan, et al.
Published: (2026)

On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
by: Huang, Lingxiao, et al.
Published: (2022)

Fine-Grained Complexity of Continuous Euclidean k-Center
by: Blank, Lotte, et al.
Published: (2026)

Near-Optimal Bounds for Parameterized Euclidean k-means
by: Cohen-Addad, Vincent, et al.
Published: (2026)

Parameterized Approximation of Rectangle Stabbing
by: Chu, Huairui, et al.
Published: (2026)

Euclidean Embedding of Data Using Local Distances
by: Arabadjis, Dimitris
Published: (2026)

Bounding the Treewidth of Outer $k$-Planar Graphs via Triangulations
by: Firman, Oksana, et al.
Published: (2024)

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
by: Hliněný, Petr, et al.
Published: (2025)

Recognizing 2-Layer and Outer $k$-Planar Graphs
by: Kobayashi, Yasuaki, et al.
Published: (2024)

Non-Euclidean Erdős-Anning Theorems
by: Eppstein, David
Published: (2024)

Ranking and Unranking of the Planar Embeddings of a Planar Graph
by: Di Battista, Giuseppe, et al.
Published: (2024)

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

Integrating kNN with Foundation Models for Adaptable and Privacy-Aware Image Classification
by: Doerrich, Sebastian, et al.
Published: (2024)

Optimal Euclidean Tree Covers
by: Chang, Hsien-Chih, et al.
Published: (2024)

Searching in Euclidean Spaces with Predictions
by: Cabello, Sergio, et al.
Published: (2024)

Euclidean TSP in Narrow Strips
by: Alkema, Henk, et al.
Published: (2020)

Topolow: Force-Directed Euclidean Embedding of Dissimilarity Data with Robustness Against Non-Metricity and Sparsity
by: Arhami, Omid, et al.
Published: (2025)

Minimum Consistent Subset in Interval Graphs and Circle Graphs
by: Manna, Bubai
Published: (2024)

Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
by: Jain, Naman
Published: (2024)

Upward Pointset Embeddings of Planar st-Graphs
by: Alegria, Carlos, et al.
Published: (2024)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
by: Greenhut, Daniel, et al.
Published: (2025)

Sparse Outerstring Graphs Have Logarithmic Treewidth
by: An, Shinwoo, et al.
Published: (2024)

Leveraging Biases in Large Language Models: "bias-kNN'' for Effective Few-Shot Learning
by: Zhang, Yong, et al.
Published: (2024)

Clasificación kNN de documentos usando GPU
by: Rubén Bresler Camps
Published: (2011)