Related Experiment Video
Updated: Aug 24, 2026

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
Published on: September 8, 2023
An efficient parallel algorithm for shortest paths in planar layered digraphs
1Dept. of Applied Mathematics, Birla Institute of Technology, Mesra, Ranchi 835215, India. pkmishra@ieee.org
Abstract:
This paper presents an efficient parallel algorithm for the shortest path problem in planar layered digraphs that runs in O(log3n) time with n processors. The algorithms uses a divide and conquer approach and is based on the novel idea of a one-way separator, which has the property that any directed path can be crossed only once.
Related Concept Videos
Design Example: Alignment of a Road Line Using GIS
The Distance Formula
Optimization Problems
Fast Decoupled and DC Powerflow
Steady, Laminar Flow Between Parallel Plates
Lagrange Multipliers: Two Constraints