×

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


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
PDF BibTeX XML Cite
Full Text: DOI