- Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
A new deterministic algorithm solves single-source shortest paths in O(mlog2/3n) time, beating Dijkstra's complexity on sparse graphs.
2025/04/23 by Ran Duan, Duan, Ran, Jiayi Mao +7 · 54 voices · 16 citations
Biochemistry, Genetics and Molecular Biology · Computer Science · #Algorithms and Data Compression #DNA and Biological Computing #Directed graph #Enhanced Data Rates for GSM Evolution #Floyd–Warshall algorithm #Machine Learning and Algorithms #Path (computing) #Shortest Path Faster Algorithm #Shortest path problem #Sorting #Upper and lower bounds
- Shortest paths in the plane with convex polygonal obstacles
1986/08/01 by Hans Rohnert · 1 citation
Computer Science · Mathematics · #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Convex hull #Dijkstra's algorithm #Disjoint sets #Euclidean shortest path #Floyd–Warshall algorithm #Geometry #Graph #K shortest path routing #Mathematics #Optimization and Search Problems #Path (computing) #Plane (geometry) #Regular polygon #Robotic Path Planning Algorithms #Shortest Path Faster Algorithm #Shortest path problem #Yen's algorithm
- A linear-time algorithm for a special case of disjoint set union
1983/01/01 by Harold N. Gabow, Robert E. Tarjan · 5 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Optimization and Search Problems #Interconnection Networks and Systems #Disjoint sets #Ackermann function #Algorithm #Disjoint union (topology) #Computer science #Floyd–Warshall algorithm #Time complexity #Matching (statistics) #Cardinality (data modeling) #Binary logarithm #Mathematics #Combinatorics #Discrete mathematics #Graph #Shortest path problem #Inverse #Dijkstra's algorithm
- A transitive closure algorithm
1970/03/01 by Paul Purdom, Paul W. Purdom · 2 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Algorithms and Data Compression #Binary logarithm #Closure (psychology) #Combinatorics #Complexity and Algorithms in Graphs #Dijkstra's algorithm #Directed graph #Discrete mathematics #Floyd–Warshall algorithm #Graph #Line graph #Mathematics #Shortest path problem #Time complexity #Transitive closure #Transitive reduction #Transitive relation #Undirected graph #Voltage graph