USE OF MELENTIEV'S GRAPH REPRESENTATION METHOD FOR IDENTIFICATION AND ENUMERATION OF CIRCUITS OF THE GIVEN LENGTH
Within a problem of scaling of parallel applications, the method of solution of a task of searching of simple circuits of the given length in the graph of the computing system with use of its projective description is offered. The method can be used both in the theory of computing systems, and in the graph theory, a logistics and other researches, the bound to use of the graph theory.