On the public citation graph
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
0 signed · 51 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jagm.2000.1080openalex-snapshot
Floats, Integers, and Single Source Shortest Paths
inferredcites →https://doi.org/10.1007/3-540-45022-x_7openalex-snapshot
Improved Shortest Paths on the Word RAM
inferredcites →https://doi.org/10.1007/3-540-61680-2_51openalex-snapshot
Priority queues: Small, monotone and trans-dichotomous
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0020-0190(75)90056-3openalex-snapshot
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
inferredcites →https://doi.org/10.1016/0022-0000(93)90040-4openalex-snapshot
Surpassing the information theoretic bound with fusion trees
inferredcites →https://doi.org/10.1016/0196-6774(88)90031-4openalex-snapshot
Algorithms for two bottleneck optimization problems
inferredcites →https://doi.org/10.1016/j.jcss.2004.04.003openalex-snapshot
Integer priority queues with decrease key in constant time and the single source shortest paths problem
inferredcites →https://doi.org/10.1016/s0022-0000(05)80064-9openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferredcites →https://doi.org/10.1016/s0022-0000(73)80033-9openalex-snapshot
Time bounds for selection
inferredcites →https://doi.org/10.1109/focs54457.2022.00063openalex-snapshot
Negative-Weight Single-Source Shortest Paths in Near-linear Time
inferredcites →https://doi.org/10.1109/focs54457.2022.00064openalex-snapshot
Maximum Flow and Minimum-Cost Flow in Almost-Linear Time
inferredcites →https://doi.org/10.1109/focs57990.2023.00035openalex-snapshot
A Randomized Algorithm for Single-Source Shortest Path on Undirected Real-Weighted Graphs
inferredcites →https://doi.org/10.1109/focs57990.2023.00038openalex-snapshot
Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!
inferredcites →https://doi.org/10.1109/focs61266.2024.00125openalex-snapshot
Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps
inferredcites →https://doi.org/10.1109/sfcs.1978.3openalex-snapshot
A dichromatic framework for balanced trees
inferredcites →https://doi.org/10.1137/1.9781611978322.178openalex-snapshot
Faster single-source shortest paths with negative real weights via proper hop distance
inferredcites →https://doi.org/10.1137/s0097539702419650openalex-snapshot
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
inferredcites →https://doi.org/10.1145/1824777.1824790openalex-snapshot
Nondecreasing paths in a weighted graph or
inferredcites →https://doi.org/10.1145/201019.201022openalex-snapshot
A randomized linear-time algorithm to find minimum spanning trees
inferredcites →https://doi.org/10.1145/261342.261352openalex-snapshot
Recent results on the single-source shortest paths problem
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/316542.316548openalex-snapshot
Undirected single-source shortest paths with positive integer weights in linear time
inferredcites →https://doi.org/10.1145/3618260.3649614openalex-snapshot
Single-Source Shortest Paths with Negative Real Weights in Õ(𝑚𝑛 8/9 ) Time
inferredcites →https://doi.org/10.1145/50087.50096openalex-snapshot
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
inferredcites →https://doi.org/10.1145/800061.808754openalex-snapshot
Data structures for on-line updating of minimum spanning trees
inferredcites →https://doi.org/10.4230/lipics.stacs.2016.27openalex-snapshot
Bottleneck Paths and Trees and Deterministic Graphical Games
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.5388845openalex-extracted
SCGraph: A Dependency-Free Python Package for Road, Rail, and Maritime Shortest Path Routing Generation and Distance Estimation
inferred← citeshttps://doi.org/10.1007/978-3-032-39143-8_2openalex-snapshot
Decentralised Dynamic Reconfiguration of Compositional Software Architectures
inferred← citeshttps://doi.org/10.1016/j.ast.2026.112361openalex-snapshot
GNN-ASSSP: A study of an attention mechanism driven dynamic routing algorithm for LEO satellite networks
inferred← citeshttps://doi.org/10.1016/j.jmaa.2026.130801openalex-snapshot
Shortest paths in planar domains with hyperbolic type metrics
inferred← citeshttps://doi.org/10.1109/icisessc68634.2026.11542622openalex-snapshot
Optimized Pilot Reuse and Beamforming for STAR-RIS—NOMA Using a Bounded Multi-Source Shortest Path Framework
inferred← citeshttps://doi.org/10.1109/syscon66367.2026.11503538openalex-snapshot
Autonomous Exploration Planning using Directed Single-Source Shortest Paths
inferred← citeshttps://doi.org/10.1109/tnsm.2026.3716021openalex-snapshot
A Robust Traffic Engineering Method With Siamese GCN-Based Link Failure Awareness
inferred← citeshttps://doi.org/10.1145/3798129.3800746openalex-snapshot
Shortcutting for Negative-Weight Shortest Paths
inferred← citeshttps://doi.org/10.1145/3798129.3800789openalex-snapshot
Approximation Schemes for Edit Distance and LCS in Quasi-Strongly Subquadratic Time
inferred← citeshttps://doi.org/10.1145/3798129.3800790openalex-snapshot
Trust Region Interior Point Methods: Optimal ℓ₂- and Faster Wide-Neighborhood Path Following
inferred← citeshttps://doi.org/10.1145/3798129.3800902openalex-snapshot
From Hop Reduction to Sparsification for Negative Length Shortest Paths
inferred← citeshttps://doi.org/10.14778/3836663.3836693openalex-snapshot
Nav-Index: A High-Performance, Adaptive Index for Shortest Path Queries in RDBMS
inferred← citeshttps://doi.org/10.2139/ssrn.5777186openalex-snapshot
BMSSPy: A Python Package and Empirical Comparison of Bounded Multi-Source Shortest Path Algorithm
inferred← citeshttps://doi.org/10.2139/ssrn.6357951openalex-snapshot
Hardness Results and an Efficient Heuristic for Safest Path Computation under Correlated Failures in Real-World and Synthetic Backbone Networks
inferred← citeshttps://doi.org/10.2514/6.2026-1460openalex-snapshot
Multi-Objective Graph Search for Automated Planetary Moon Tour Design
inferred← citeshttps://doi.org/10.3390/jmse13101863openalex-snapshot
Dijkstra and A* Algorithms for Algorithmic Optimization of Maritime Routes and Logistics of Offshore Wind Farms
inferred← citeshttps://doi.org/10.3390/make8100296openalex-snapshot
Learning to Route On-Chip: A Survey of Machine Learning-Based Routing in Networks-on-Chip and Its Hardware Overheads
inferred← citeshttps://doi.org/10.35377/saucis...1853953openalex-snapshot
Breaking the Sorting Barrier in Practice: A Comparative Analysis of Deterministic Path Planning for Autonomous Surface Vessels
inferred← citeshttps://doi.org/10.5753/etc.2026.22057openalex-snapshot
Análise assintótica e empírica de filas de prioridade avançadas aplicadas ao Algoritmo de Dijkstra
inferred← citeshttps://doi.org/10.5753/wperformance.2026.23674openalex-snapshot
Avaliação do desempenho de Multilevel Bucket Queues na determinação de caminhos mínimos em arquiteturas modernas
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.