Short communicationA synchronous algorithm for shortest paths on a tree machine
References (9)
On a routing problem
Quarterly Appl. Math.
(1958)- et al.
A tree machine for searching problems
Computation on a tree of processors
- et al.
Shortest path algorithms: taxonomy and notation
Cited by (3)
A time-delay neural network for solving time-dependent shortest path problem
2017, Neural NetworksCitation 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 SystemsSolving 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.