Algorithm of Construction of Ordering of the Objects Nearest to the Any Relation on Set of Objects
| Data(s) |
07/12/2009
07/12/2009
2007
|
|---|---|
| Resumo |
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. |
| Identificador |
1313-0463 |
| Idioma(s) |
en |
| Publicador |
Institute of Information Theories and Applications FOI ITHEA |
| Palavras-Chave | #Ranking #Binary Relation #Acyclicity #Basic Variant #Consecutive Analysis of Variants |
| Tipo |
Article |
