Elsevier

Parallel Computing

Volume 18, Issue 1, January 1992, Pages 103-107
Parallel Computing

Short communication
A synchronous algorithm for shortest paths on a tree machine

https://doi.org/10.1016/0167-8191(92)90115-NGet rights and content

Abstract

This paper presents a synchronous (SIMD) algorithm for solving the single source problem for finding shortest paths in a network on a tree machine model. The algorithm requires O(N log2 N) complexity time using a tree machine with N leaf processing elements.

References (9)

  • R. Bellman

    On a routing problem

    Quarterly Appl. Math.

    (1958)
  • J.L. Bentley et al.

    A tree machine for searching problems

  • S.A. Browing

    Computation on a tree of processors

  • N. Deo et al.

    Shortest path algorithms: taxonomy and notation

There are more references available in the full text version of this article.

Cited by (3)

  • A time-delay neural network for solving time-dependent shortest path problem

    2017, Neural Networks
    Citation Excerpt :

    The classical shortest path problem is about finding the shortest path from a specified source to multiple destinations in a given network while minimizing the total time or distance associated with each path (Ahuja, Magnanti, & Orlin, 1993; Cooke & Halsey, 1966; Dijkstra, 1959; Fang, Yang, & Xue, 2013; Valera, Seah, & Rao, 2005). It is essentially an optimization problem and such a problem has been used in widespread applications in a variety of settings, such as managing telephone traffic, transportation networks, QoS routing, robot path planning, layout of printed circuit boards, scheduling, and urban trip engineering (Androutsopoulos & Zografos, 2008; Antonio, Huang, & Tsai, 1992; Desrosiers, Dumas, & Soumis, 1986; El-Horbaty & Mohamed, 1992; Handler & Zang, 1980; Lester, 2005; Tang, Zhang, & Chen, 2008). Many approaches have been proposed to address the shortest path problem on a certain network.

  • A minimum resource neural network framework for solving multiconstraint shortest path problems

    2014, IEEE Transactions on Neural Networks and Learning Systems
  • Solving the shortest path problem using an analog network

    1999, IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
1

Present address: Dept. of Maths. and Comp. Science, Emirates University, Al-Ain, U.A.E.

View full text