The author considers the problem of allocating time segments between network nodes and of eliminating conflicts; this problem reduces to one of coloring the vertices of a finite nonoriented graph. A method of solving the problem, involving self-training based on a sequential algorithm, is proposed. Computer experiments demonstrate that the method is effective in coloring graphs containing hundreds of vertices.