On the public citation graph

A single source shortest path algorithm for a planar distributed network

https://doi.org/10.1007/bfb0024003
0 signed · 43 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.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0166-5316(81)90048-1openalex-snapshot
An all-pairs shortest-path distributed algorithm
inferredcites →https://doi.org/10.1109/sfcs.1983.69openalex-snapshot
Shortest path problems in planar graphs
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0216064openalex-snapshot
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot
Efficient Algorithms for Shortest Paths in Sparse Networks
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.21236/ada117808openalex-snapshot
Distributed Minimum Hop Algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1002/scj.4690201002openalex-snapshot
An efficient distributed algorithm for constructing a breadth‐first search tree
inferred← citeshttps://doi.org/10.1002/scj.4690250905openalex-snapshot
A distributed shortest‐paths algorithm with distance‐dependent message complexities
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_10openalex-snapshot
Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
inferred← citeshttps://doi.org/10.1007/978-1-4612-4808-8_33openalex-snapshot
Distributed Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1007/bf02835831openalex-snapshot
Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
inferred← citeshttps://doi.org/10.1007/bfb0019808openalex-snapshot
On the use of synchronizers for asynchronous communication networks
inferred← citeshttps://doi.org/10.1007/bfb0023988openalex-snapshot
STACS 85
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90257-aopenalex-snapshot
The lower bounds on distributed shortest paths
inferred← citeshttps://doi.org/10.1016/0196-6774(92)90017-7openalex-snapshot
On finding and updating shortest paths distributively
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90291-zopenalex-snapshot
An optimal distributed algorithm for recognizing mesh-connected networks
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90051-iopenalex-snapshot
A distributed shortest path algorithm for a planar network
inferred← citeshttps://doi.org/10.1016/s0140-3664(96)01094-8openalex-snapshot
Efficient distributed breadth-first search algorithm
inferred← citeshttps://doi.org/10.1109/12.29464openalex-snapshot
Distributed algorithms for network recognition problems
inferred← citeshttps://doi.org/10.1109/32.24713openalex-snapshot
An efficient distributed protocol for finding shortest paths in networks with negative weights
inferred← citeshttps://doi.org/10.1109/cts.2010.5478520openalex-snapshot
Dynamic state-based routing for load balancing and efficient data gathering in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/fscs.1990.89572openalex-snapshot
Network synchronization with polylogarithmic overhead
inferred← citeshttps://doi.org/10.1109/icpads47876.2019.00135openalex-snapshot
Electrical Sensing and Control Information Flows Optimization Algorithm in Cyber Power Physical System
inferred← citeshttps://doi.org/10.1109/igcc.2016.7892587openalex-snapshot
Traffic scheduling with sustainable Cyber Physical Systems applying in smart grid
inferred← citeshttps://doi.org/10.1109/isa.2011.5873399openalex-snapshot
Distributed Metering Information Control Algorithm in Smart Micro Grid
inferred← citeshttps://doi.org/10.1109/noc.2015.7238609openalex-snapshot
Scalable routing, scheduling and virtualization for TWIN optical burst switching networks
inferred← citeshttps://doi.org/10.1109/sfcs.1985.20openalex-snapshot
Distributed BFS algorithms
inferred← citeshttps://doi.org/10.1109/tac.2011.2163875openalex-snapshot
Energy Optimized Topologies for Distributed Averaging in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tit.1987.1057314openalex-snapshot
A new distributed algorithm to find breadth first search trees
inferred← citeshttps://doi.org/10.1109/vtcfall.2014.6965944openalex-snapshot
Distributed Sink Tree Construction in Wireless Sensor Networks with Promiscuous Learning
inferred← citeshttps://doi.org/10.1145/1103963.1103968openalex-snapshot
Computing almost shortest paths
inferred← citeshttps://doi.org/10.1145/2452376.2452413openalex-snapshot
Efficient breadth-first search on large graphs with skewed degree distributions
inferred← citeshttps://doi.org/10.1145/3055399.3055452openalex-snapshot
Distributed exact shortest paths in sublinear time
inferred← citeshttps://doi.org/10.1145/3387161openalex-snapshot
Distributed Exact Shortest Paths in Sublinear Time
inferred← citeshttps://doi.org/10.1145/383962.383983openalex-snapshot
Computing almost shortest paths
inferred← citeshttps://doi.org/10.1145/73007.73054openalex-snapshot
Randomized distributed shortest paths algorithms
inferred← citeshttps://doi.org/10.1145/99508.99550openalex-snapshot
Shortest paths and loop-free routing in dynamic networks
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5023openalex-snapshot
Designing Efficient Algorithms for Distributed Systems.
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5277openalex-snapshot
Parallel and Distributed Algorithms for a Class of Graph-Related Computational Problems.
inferred← citeshttps://doi.org/10.5121/ijwmn.2013.5502openalex-snapshot
K-DAG Based Lifetime Aware Data Collection in Wireless Sensor Networks
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.