Imagen de Portada

Three Algorithms for Merging Hierarchical Navigable Small World Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Ponomarenko, Alexander
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
por: Sun, Ming, et al.
Publicado: (2022)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Greedy Routing in a Sequentially Grown One-Dimensional Random Graph
por: Ponomarenko, Alexander
Publicado: (2026)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
por: Dehghankar, Mohsen, et al.
Publicado: (2025)

Improved Approximation Algorithms for Three-Dimensional Knapsack
por: Jansen, Klaus, et al.
Publicado: (2025)

Review of Three Algorithms That Build k-d Trees
por: Brown, Russell A.
Publicado: (2025)

Merging RLBWTs adaptively
por: Gagie, Travis
Publicado: (2025)

Automating the Search for Small Hard Examples to Approximation Algorithms
por: Sharma, Eklavya
Publicado: (2025)

Faster Algorithms for Graph Monopolarity
por: Philip, Geevarghese, et al.
Publicado: (2024)

Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
por: Plank, Benedikt M., et al.
Publicado: (2022)

Smoothed Analysis of Dynamic Graph Algorithms
por: Meir, Uri, et al.
Publicado: (2025)

Pointwise Lipschitz Continuous Graph Algorithms
por: Liu, Quanquan C., et al.
Publicado: (2024)

Succinct Graph Representations and Algorithmic Applications
por: Ullah, Ahammed, et al.
Publicado: (2026)

Small-Space Algorithms for the Online Language Distance Problem for Palindromes and Squares
por: Bathie, Gabriel, et al.
Publicado: (2023)

Graph-Based Algorithms for Diverse Similarity Search
por: Anand, Piyush, et al.
Publicado: (2025)

Fast Algorithms for Graph Arboricity and Related Problems
por: Cen, Ruoxu, et al.
Publicado: (2025)

Improved Algorithms for Effective Resistance Computation on Graphs
por: Yang, Yichun, et al.
Publicado: (2025)

Efficient Kernelization Algorithm for Bipartite Graph Matching
por: Wu, Guang, et al.
Publicado: (2024)

Finding Induced Subgraphs from Graphs with Small Mim-Width
por: Otachi, Yota, et al.
Publicado: (2024)

Bounded Edit Distance: Optimal Static and Dynamic Algorithms for Small Integer Weights
por: Gorbachev, Egor, et al.
Publicado: (2024)

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
por: Kiran, Mekala, et al.
Publicado: (2026)

Improved Sublinear Algorithms for Classical and Quantum Graph Coloring
por: Ferber, Asaf, et al.
Publicado: (2025)

Streaming Graph Algorithms in the Massively Parallel Computation Model
por: Czumaj, Artur, et al.
Publicado: (2025)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
por: Zhao, Jingyang, et al.
Publicado: (2025)

Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs
por: Borowitz, Jannick, et al.
Publicado: (2023)

Fully Dynamic Algorithms for Coloring Triangle-Free Graphs
por: Assadi, Sepehr, et al.
Publicado: (2026)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
por: Bergougnoux, Benjamin, et al.
Publicado: (2023)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
por: Zhao, Jingyang, et al.
Publicado: (2023)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
por: Feldmann, Andreas Emil, et al.
Publicado: (2024)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
por: Łącki, Jakub, et al.
Publicado: (2025)

Algorithms for Distance Sensitivity Oracles and other Graph Problems on the PRAM
por: Manoharan, Vignesh, et al.
Publicado: (2025)

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
por: Peng, Pan, et al.
Publicado: (2026)

Algorithms for Optimally Shifting Intervals under Intersection Graph Models
por: Honorato-Droguett, Nicolás, et al.
Publicado: (2023)

Gabow's Cardinality Matching Algorithm in General Graphs: Implementation and Experiments
por: Ansaripour, Matin, et al.
Publicado: (2024)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
por: Ashvinkumar, Vikrant, et al.
Publicado: (2024)

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
por: Bansal, Nikhil, et al.
Publicado: (2026)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
por: Abboud, Amir, et al.
Publicado: (2023)

Algorithmic Reductions: Network Flow and NP-Completeness in Real-World Scheduling Problems
por: Sinhal, Anay, et al.
Publicado: (2026)

Real-World Graph Analysis: Techniques for Static, Dynamic, and Temporal Communities
por: Rucci, Davide
Publicado: (2024)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
por: Ding, Xiangyun, et al.
Publicado: (2025)