Minkowski metric with k = 1. The shortest path from a to b walking on a co-ordinate axis. Named for the streets of Manhattan, which resemble a co-ordinate axis [Pg.543]

The application research of K shortest path algorithm in avoiding mine disaster [Pg.423]

K.L. Clarkson, Approximation algorithms for shortest path motion planning, proc. 19th Ann. Symp. on Theory of Computing, 1987, 56-65. [Pg.485]

Narvaez, P, Siu, K.Y., Tzeng, H.Y. New dynamic algorithms for shortest path tree computation. lEEE/ACM Transactions on Networking 8(6), 734-746 (2000) [Pg.80]

R. Dorairaj and G. Lakhani. A VLSI implementation of all-pair shortest path problem. In ICPP 81 pages 207-209. S. K. Sahni, editor. The Pennsylvania State University Press, 1987. [Pg.67]

R.K. Ahuja, K. Mehlhom, J.B. Orlin, R.E. Tarjan, Faster algorithms for the shortest path problem, J. Asso. Comput. Mach., 1990. [Pg.485]

AKC 10] Akca Z., Ralphs T.K., Berger R.T., Solution methods for the multi-trip elementary shortest path problem with resource constraints . Optimization Online the Mathematical Programming Society, 2010 [Pg.298]

Gupta, S. K., Kececioglu, J. D., Schaffer, A. A. (1995) Improving the practical space and time efficiency of the shortest-path approach to sum-of-pairs multiple sequence alignment, J. Comp. Biol. 2 459-472. [Pg.74]

For aqrclic graphs, connectivity indices for path subgraphs can be calculated by the Wiener operator applied to the product of the path-% matrix and the geodesic matrix B whose elements are all equal to zero except for those corresponding to the shortest paths i-j of length k that are equal to 1 [Pg.903]

To get higher orders of distances we repeat the process. We look for an element that is still zero, a, = 0 and inspect whether aij > 1 and aj k > 1 for y = 1,..., n. We insert into a k the minimal nonzero sum of Uij + aj k- This is justified, because in a cyclic molecule, say cyclohexane, atom 1 is connected to atom 6 either directly or via 2, 3,4, and 5. So we are fixing the shortest path. For completeness, we give the final distance matrix that has eventually a maximum order of 3 [Pg.550]

© 2019 chempedia.info