| Jan van Leeuwen - 1994 - 536 sider
...1972. In Russian. 56. GJ Minty. Monotone Networks. Proc. Roy. Soc. London, A(257):194-212, 1960. 57. EF Moore. The Shortest Path Through a Maze. In Proc....Int. Symp. on the Theory of Switching, pages 285-292. Harvard University Press, 1959. 58. R. Motwani. Expanding Graphs and the Average-case Analysis of Algorithms... | |
| Panos M. Pardalos, Donald W. Hearn, William W. Hager - 1997 - 498 sider
...and BN Livshits. Nelineinye Setevye Transportnye Zadachi. Transport, Moscow, 1972. In Russian. 15. EF Moore. The Shortest Path Through a Maze. In Proc....Int. Symp. on the Theory of Switching, pages 285-292. Harvard University Press, 1959. 16. P. Van Emde Boas and R. Kaas and E. Zijlstra. Design and implementation... | |
| Sandeep Nautam Bhatt - 1997 - 184 sider
...ACM SIG CS Education Bulletin, 23(1), March 1991. [8] E. F. Moore, The shortest path through a maze. Proc. of the Int. Symp. on the Theory of Switching, pages 285-292, Harvard University Press, 1959. [9] G. Pantziou, P. Spirakis, and C. Zaroliagis, Efficient parallel... | |
| R. Burkard, P. Deuflhard, A. Jameson, J.-L. Lions, G. Strang - 2000 - 434 sider
...An upper bound for the probability of a union. Journal of Aplied Probability 13, 1976, 597-603. [14] EF Moore, The shortest path through a maze. In Proc. of the Int. Symp. on the Theory of Switching, Harvard University Press, 1959, pp. 285-292. [15] R. Rado, Note on independence functions. Proceedings... | |
| |