Matrixes of Relations between Pairs Objects and Transformations between Various Kinds

Ways of representation of relations between pair's objects are described at a complete choice. Methods of revealing and kinds of relations between objects are considered. The table of conformity between various forms of representation of relations is resulted.

An Optimal Distributed Algorithm for All-Pairs Shortest-Path

In this paper the network problem of determining all-pairs shortest-path is examined. A distributed algorithm which runs in O(n) time on a network of n nodes is presented. The number of messages of the algorithm is O(e+n log n) where e is the number of communication links of the network. We prove that this algorithm is time optimal.