Yen, Jin Y. Finding the length of all shortest paths in \(N\)-node nonnegative-distance complete networks using \(N^3\) additions and \(N^3\) comparisons. (English) Zbl 0242.94028 J. Assoc. Comput. Mach. 19, 423-424 (1972). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 3 Documents MSC: 94C10 Switching theory, application of Boolean algebra; Boolean functions (MSC2010) 94-04 Software, source code, etc. for problems pertaining to information and communication theory × Cite Format Result Cite Review PDF Full Text: DOI