Simulation of Behavior and Intelligence

An algorithm for restructuring in the problem of graph approximation

E. V. Bauman, I. B. Muchnik

Moscow

Abstract: The paper is concerned with approximation of a graph by a graph of with a small number of vertices, a problem stated in Ref. [4]. A procedure is proposed whereby the blocks and the structure of the smaller graph are found without assuming that these blocks make a decomposition of the set of vertices of the initial graph. Results of experimental verification are described.

UDC: 519.283


Received: 06.08.1975

 English version: Automation and Remote Control, 1976, 37:6, 920–927

Bibliographic databases:

•