On the public citation graph

Semi-dynamic shortest paths and breadth-first search in digraphs

https://doi.org/10.1007/bfb0023446
0 signed · 56 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/3-540-57155-8_269openalex-snapshot
A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
inferredcites →https://doi.org/10.1007/3-540-60084-1_78openalex-snapshot
Shortest path queries in digraphs of small treewidth
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bfb0024016openalex-snapshot
A dynamization of the All Pairs Least Cost Path Problem
inferredcites →https://doi.org/10.1007/bfb0049421openalex-snapshot
On the structure of DFS-forests on directed graphs and the dynamic maintenance of DFS on DAG's
inferredcites →https://doi.org/10.1016/0016-0032(51)90436-xopenalex-snapshot
Methods of operations research
inferredcites →https://doi.org/10.1016/0020-0190(90)90155-qopenalex-snapshot
Recognizing breadth-first search trees in linear time
inferredcites →https://doi.org/10.1016/0196-6774(91)90036-xopenalex-snapshot
Incremental algorithms for minimal length paths
inferredcites →https://doi.org/10.1016/0304-3975(93)90328-qopenalex-snapshot
Dynamic algorithms for shortest paths in planar graphs
inferredcites →https://doi.org/10.1137/0606031openalex-snapshot
Amortized Computational Complexity
inferredcites →https://doi.org/10.1142/1181openalex-snapshot
Algorithms and Complexity
inferredcites →https://doi.org/10.1145/195058.195092openalex-snapshot
Faster shortest-path algorithms for planar graphs
inferredcites →https://doi.org/10.1145/322234.322235openalex-snapshot
An On-Line Edge-Deletion Problem
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

What points at this work

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

inferred← citeshttps://doi.org/10.1002/dac.684openalex-snapshot
GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks
inferred← citeshttps://doi.org/10.1002/dac.976openalex-snapshot
An efficient pursuit automata approach for estimating stable all‐pairs shortest paths in stochastic network environments
inferred← citeshttps://doi.org/10.1006/jagm.1999.1048openalex-snapshot
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
inferred← citeshttps://doi.org/10.1007/3-540-36383-1_11openalex-snapshot
Implementations and Experimental Studies of Dynamic Graph Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44691-5_19openalex-snapshot
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_14openalex-snapshot
Decremental maintenance of reachability in hypergraphs and minimum models of horn formulae
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_27openalex-snapshot
Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights
inferred← citeshttps://doi.org/10.1007/978-3-540-24677-0_26openalex-snapshot
Stochastic Learning Automata-Based Dynamic Algorithms for the Single Source Shortest Path Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-32281-5_29openalex-snapshot
Dynamic Graph Shortest Path Algorithm
inferred← citeshttps://doi.org/10.1007/s00607-012-0263-3openalex-snapshot
Finding large $$k$$ -clubs in undirected graphs
inferred← citeshttps://doi.org/10.1007/s40009-018-0674-6openalex-snapshot
A Retroactive Approach for Dynamic Shortest Path Problem
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.08.023openalex-snapshot
Multicast algorithms in service overlay networks
inferred← citeshttps://doi.org/10.1016/j.neucom.2016.02.068openalex-snapshot
Benchmarking a recurrent neural network based efficient shortest path problem (SPP) solver concept under difficult dynamic parameter settings conditions
inferred← citeshttps://doi.org/10.1016/s0140-3664(03)00160-9openalex-snapshot
Fast restoring gigabit wireless networks using a directional mesh architecture
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00132-2openalex-snapshot
Semi-dynamic breadth-first search in digraphs
inferred← citeshttps://doi.org/10.1101/gr.277206.122openalex-snapshot
Characterization of network hierarchy reflects cell state specificity in genome organization
inferred← citeshttps://doi.org/10.1109/90.893870openalex-snapshot
New dynamic algorithms for shortest path tree computation
inferred← citeshttps://doi.org/10.1109/90.974525openalex-snapshot
New dynamic SPT algorithm based on a ball-and-string model
inferred← citeshttps://doi.org/10.1109/ainaw.2007.353openalex-snapshot
The Pursuit Automaton Approach for Estimating All-Pairs Shortest Paths in Dynamically Changing Networks
inferred← citeshttps://doi.org/10.1109/apcc.2003.1274313openalex-snapshot
Dynamic routing protocols for anycast packet forwarding
inferred← citeshttps://doi.org/10.1109/icc.2003.1204188openalex-snapshot
Achieving faster failure detection in OSPF networks
inferred← citeshttps://doi.org/10.1109/icct62411.2024.10946554openalex-snapshot
IGP Convergence Optimization with AI
inferred← citeshttps://doi.org/10.1109/icnp.2013.6733581openalex-snapshot
Dynamic distributed algorithm for computing multiple next-hops on a tree
inferred← citeshttps://doi.org/10.1109/ictai.2008.27openalex-snapshot
Navigation and Guidance Planning for Air Vehicles
inferred← citeshttps://doi.org/10.1109/icumt.2013.6798401openalex-snapshot
Survey on features of millimeter wave communication networks
inferred← citeshttps://doi.org/10.1109/infcom.1999.751488openalex-snapshot
New dynamic SPT algorithm based on a ball-and-string model
inferred← citeshttps://doi.org/10.1109/iscc.2004.1358653openalex-snapshot
Generalized pursuit learning algorithms for shortest path routing tree computation
inferred← citeshttps://doi.org/10.1109/iscc.2005.107openalex-snapshot
New Algorithms for Maintaining All-Pairs Shortest Paths
inferred← citeshttps://doi.org/10.1109/iscis.2008.4717887openalex-snapshot
A heuristic approach to military transition problem
inferred← citeshttps://doi.org/10.1109/pdcat.2005.64openalex-snapshot
Aggregation Tree Routing Algorithm for Dynamic Topology in Large Scale Networks
inferred← citeshttps://doi.org/10.1109/surv.2011.011411.00065openalex-snapshot
Improving Convergence Speed and Scalability in OSPF: A Survey
inferred← citeshttps://doi.org/10.1109/tc.2006.83openalex-snapshot
An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks
inferred← citeshttps://doi.org/10.1109/tsmcb.2005.850180openalex-snapshot
Dynamic Algorithms for the Shortest Path Routing Problem: Learning Automata-Based Solutions
inferred← citeshttps://doi.org/10.1145/1282380.1282408openalex-snapshot
Achieving convergence-free routing using failure-carrying packets
inferred← citeshttps://doi.org/10.1145/297096.297147openalex-snapshot
Experimental analysis of dynamic algorithms for the single source shortest paths problem
inferred← citeshttps://doi.org/10.1155/2012/560184openalex-snapshot
Using Genetic Algorithms for Navigation Planning in Dynamic Environments
inferred← citeshttps://doi.org/10.1587/transcom.e92.b.717openalex-snapshot
Cognitive Shortest Path Tree Restoration (CSPTR) for MANET Using Cost-Sensitivity Analysis
inferred← citeshttps://doi.org/10.22215/etd/2006-06188openalex-snapshot
Adaptive algorithms for routing and traffic engineering in stochastic networks
inferred← citeshttps://doi.org/10.4018/978-1-60566-026-4.ch548openalex-snapshot
Shortest Path Routing Algorithms in Multihop Networks
inferred← citeshttps://doi.org/10.47749/t/unicamp.2007.410168openalex-snapshot
Modelos e algoritmos de cabeamento de redes telefonicas
inferred← citeshttps://doi.org/10.48550/arxiv.1903.01756openalex-snapshot
Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights
inferred← citeshttps://doi.org/10.5555/1784037.1784059openalex-snapshot
Failure insensitive routing for ensuring service availability
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.