Artificial intelligence

Abstract: Graphs with labeled vertices are one of the main models in consideration of problems associated with the analysis of the operating environment with agents moving on it as well as problems associated with the validation of program. In both cases, these graphs may contain a large number of vertices, so the problem of reducing their number with retain all properties of the graph is arisen. The reduction problem is to find a partition of all vertices of the graph into classes of equivalent states. A new algorithm for graphs reducing is proposed. It consist of next steps. The algorithm builds a correct partition into classes of equivalent states.

Keywords:

References: