On the public citation graph

Floats, integers, and single source shortest paths

https://doi.org/10.1007/bfb0028545
0 signed · 23 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1997.2632openalex-snapshot
Improved Parallel Integer Sorting without Concurrent Writing
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
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.1109/isit.1994.394967openalex-snapshot
Information and control
inferredcites →https://doi.org/10.1109/sfcs.1997.646088openalex-snapshot
Undirected single source shortest paths in linear time
inferredcites →https://doi.org/10.1145/201019.201022openalex-snapshot
A randomized linear-time algorithm to find minimum spanning trees

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.2000.1080openalex-snapshot
Floats, Integers, and Single Source Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-22191-0_57openalex-snapshot
Embedded Backups for Link Failure Recovery in Shortest Path Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-35926-2_10openalex-snapshot
Faster Replacement Paths Algorithm for Undirected, Positive Integer Weighted Graphs with Small Diameter
inferred← citeshttps://doi.org/10.1007/bfb0028575openalex-snapshot
Sorting and searching on the word RAM
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.11.040openalex-snapshot
Minmax regret location–allocation problem on a network under uncertainty
inferred← citeshttps://doi.org/10.1109/iccsn.2010.97openalex-snapshot
Two Phase Shortest Path Algorithm for Non-negative Weighted Undirected Graphs
inferred← citeshttps://doi.org/10.1109/iciet.2010.5625724openalex-snapshot
Shortest path algorithm with pre-calculated single link failure recovery for non-negative weighted undirected graphs
inferred← citeshttps://doi.org/10.1109/isci.2011.5958895openalex-snapshot
A near linear shortest path algorithm for weighted undirected graphs
inferred← citeshttps://doi.org/10.1109/itsim.2010.5561538openalex-snapshot
Improvements over two phase shortest path algorithm
inferred← citeshttps://doi.org/10.1109/sffcs.1999.814635openalex-snapshot
All pairs shortest paths in undirected graphs with integer weights
inferred← citeshttps://doi.org/10.1145/1838002.1838079openalex-snapshot
An edge-wise linear shortest path algorithm for non negative weighted undirected graphs
inferred← citeshttps://doi.org/10.1145/316542.316548openalex-snapshot
Undirected single-source shortest paths with positive integer weights in linear time
inferred← citeshttps://doi.org/10.1155/2022/9661411openalex-snapshot
A Robust Graph Theoretic Solution of Routing in Intelligent Networks
inferred← citeshttps://doi.org/10.35376/10324/16003openalex-snapshot
Parallel approaches to shortest-path problems for multilevel heterogeneous computing
inferred← citeshttps://doi.org/10.5120/640-896openalex-snapshot
An Optimized All pair Shortest Paths Algorithm
inferred← citeshttps://doi.org/10.7763/ijcee.2010.v2.263openalex-snapshot
An Efficient Algorithm for All Pair Shortest Paths
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.