scientific article; zbMATH DE number 3907592

From MaRDI portal
Publication:3685016





In this paper an attempt to characterise structured objects by methods of cluster analysis is introduced. A class of structured objects is represented by a graph where the vertex set corresponds to objects and the edge set corresponds to relations between the objects. The measure of dissimilarity for the graphs G, G' is defined by means of the sets of induced isomorphic subgraphs of G and G', respectively. The procedure of finding the dissimilarity between two graphs is transformed into the enumeration of induced subgraphs of the given graph with small degrees. In order to reduce the computational complexity the authors consider some class-stable graph transformations preserving interclass distances between the classes of graphs.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685016)