References

• 1. 1)
     • Lam, K.P., Su, C.J.: `On a binary relation inference network', Proc. IEEE 5th Int. parallel processing symp., 1991, Anaheim, CA, USA, p. 250–255.
  2. 2)
     • A.V. Aho , J.E. Hopcroft , J.D. Ullman . (1974) The design and analysis of computer algorithms.
  3. 3)
     • B.A. Carre . (1979) Graphs and networks.
  4. 4)
     • G. Rote . A systolic array algorithm for the algebraic path problem, shortest paths;matrix inversion. Comput. , 191 - 219
  5. 5)
     • D. Bertsekas , R. Gallager . (1992) Data networks.
  6. 6)
     • Sakoe, H., Isotani, R., Yoshida, K., Iso, K., Watanabe, T.: `Speaker independent wordrecognition using dynamic programming neural networks', Proc. IEEE ICASSP' 89, May 1989, Glasgow, Scotland, p. 29–32.
  7. 7)
     • J.B. Kruskal . On the shortest spanning subtree of a graph and the travelling salesmanproblem. Proc. Am. Math. Soc. , 48 - 50
  8. 8)
     • T. Takaoka , K. Umehara . An efficient VLSI algorithm for the all pairs shortestpath problem. J. of Parallel Distrib. Comput. , 265 - 270
  9. 9)
     • R. Bellman . On a routing problem. Q. Appl. Math. , 87 - 90
  10. 10)
      • Núǹez, F.J., Valero, M.: `A block algorithm for the algebraic path problem and itsexecution on a systolic array', Proceedings of International Conference on Systolic Arrays, 25–27 May 1988, p. 265–274.
  11. 11)
      • R. Sedgewick . (1988) Algorithms.
  12. 12)
      • Ford, L.R.: `Network flow theory', P-923, Technical Report, 1956.
  13. 13)
      • C. Mead . (1989) Analog VLSI and neural systems.
  14. 14)
      • R.K. Ahuja , T.L. Magnanti , J.B. Orlin . (1993) Network flows: Theory, algorithms, andapplications.
  15. 15)
      • R.W. Floyd . Algorithm 97 – shortest path. Commun. ACM
  16. 16)
      • D.P. Bertsekas , J.N. Tsitsiklis . (1989) Parallel and distributed computation: Numerical methods.
  17. 17)
      • Tong, C.W., Lam, K.P.: `Analog implementations of a binary relation inferencenetwork for minimum cost path problems', Proc. IEEE International Conference onNeural Networks, 1993, San Francisco, CA, p. 1081–1085.
  18. 18)
      • T.H. Cormen , C.E. Leiserson , R.L. Rivest , C. Stein . (2009) Introduction to algorithms.
  19. 19)
      • E.W. Dijkstra . A note on two problems in connexion with graphs. Numer. Math.
  20. 20)
      • Tong, C.W., Lam, K.P.: `VLSI implementation of binary relation inference networkin solving shortest path problems', To be published in Proceedings of IEEE International Conferenceon Neural Networks, 1994, Orlando, FL.
  21. 21)
      • Y. Robert , D. Trystram , Moore . (1987) Systolic solution of the algebraic path problem, Systolic arrays.
  22. 22)
      • P.E. Allen , D.R. Holberg . (2002) CMOS Analog Circuit Design.
  23. 23)
      • J.S. Golan . (1992) The theory of semirings with applications in mathematics and theoreticalcomputer science.
  24. 24)
      • R.C. Prim . Shortest connection networks and some generalisations. Bell Syst. Tech. J. , 1389 - 1401
  25. 25)
      • Su, C.J.: `A binary relation inference network for constrained optimisation', 1992, PhD thesis, University of British Columbia.