scientific article; zbMATH DE number 3907592

zbMATH Open0568.62055MaRDI QIDQ3685016FDOQ3685016

Authors: Fred Sobik, Erdmute Sommerfeld 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3942812
• Compatibility in a graph-theoretic setting
• Description and classification of complex structured objects by applying similarity measures
• scientific article; zbMATH DE number 194075
• A similarity measure for graphs with low computational complexity

zbMATH Keywords

applicationscluster analysiscomputational complexitypsychologyclassification algorithmchemistrymeasure of dissimilaritycharacterization of classes of graphs by induced subgraphsclass- stable graph transformations

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited In (14)

• Structural similarity measure for binary data clustering
• Title not available (Why is that?)
• Comparing large graphs efficiently by margins of feature vectors
• Clones in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Equivalent and strong equivalent graphs with application in clustering
• Title not available (Why is that?)
• Some characterizations on clustering using equivalent graphs
• Topological mappings between graphs, trees and generalized trees
• Title not available (Why is that?)
• Subobject classifier for algebraic structures
• A comparative analysis of multidimensional features of objects resembling sets of graphs
• Some simple algorithms for structural comparison

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)