Abstract: The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is resulted. The algorithm based on a method of the consecutive analysis of variants and the analysis of conditions of acyclicity is offered.

Keywords: ranking, the binary relation, acyclicity, basic variant, consecutive analysis of variants

ACM Classification Keywords: K.3.2 Computer and Information Science Education.

Link:

ALGORITHM OF CONSECUTIVE DEFINITION OF RANKING OF THE OBJECTS NEAREST TO THE SET CYCLIC RELATION BETWEEN OBJECTS

Grigoriy Gnatienko

http://www.foibg.com/ijita/vol13/ijita13-4-p09.pdf