IEEE

A Breadth First Search Algorithm for Data Clustering based on Space-time Curvature

Abstract: In this paper, we present a novel data clustering approach, i.e., a Breadth First Search (BFS) algorithm based on space-time curvature, or BFS Curvature for short. Inspired by Einstein’s ...
IEEE

Comparative Analysis of A*, Dijkstra’s, and Breadth-First Search Algorithms: Evaluating Complexity, Optimality, and Efficiency in Shortest Pathfinding

Abstract: This paper presents a comparative analysis of three widely used pathfinding algorithms: A*, Dijistra’s, and Breadth-First Search (BFS). We evaluate these algorithms based on their complexity ...
GitHub

[OSDI'25 Artifact] Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD

Welcome to the artifact repository of OSDI'25 accepted paper: Achieving Low-Latency Graph-Based Vector Search via Aligning Best-First Search Algorithm with SSD! This repository contains the ...