scientific article

From MaRDI portal

Revision as of 07:59, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3685016

Jump to:navigation, search

zbMath0568.62055MaRDI QIDQ3685016

Erdmute Sommerfeld, Fred Sobik

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity applications cluster analysis classification algorithm psychology chemistry measure of dissimilarity characterization of classes of graphs by induced subgraphs class- stable graph transformations

Mathematics Subject Classification ID

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

Related Items (3)

Comparing large graphs efficiently by margins of feature vectors ⋮ Topological mappings between graphs, trees and generalized trees ⋮ A comparative analysis of multidimensional features of objects resembling sets of graphs

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3685016&oldid=17162570"