A distributed shortest path algorithm for a planar network
From MaRDI portal
Recommendations
- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
- Faster shortest-path algorithms for planar graphs
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
- Faster shortest-path algorithms for planar graphs
- On finding and updating shortest paths distributively
Cites work
- scientific article; zbMATH DE number 3976361 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A Separator Theorem for Planar Graphs
- A new distributed algorithm to find breadth first search trees
- A note on two problems in connexion with graphs
- Applications of a Planar Separator Theorem
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
Cited in
(10)- Distributed algorithms for computing shortest pairs of disjoint paths
- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks
- An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
- Derivation of a distributed algorithm for finding paths in directed networks
- Near-optimal distributed DFS in planar graphs
- Computation of shortest path in cellular automata
- Intelligent transportation systems -- Enabling technologies
- scientific article; zbMATH DE number 2080918 (Why is no real title available?)
- Distributed algorithms for planar networks. I: Planar embedding
- Another adaptive distributed shortest path algorithm
This page was built for publication: A distributed shortest path algorithm for a planar network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918205)
