A distribution-based framework for network similarity assessment

DOI10.1016/J.AMC.2026.130179MaRDI QIDQ7347738zbMATH OpenFDO

Authors Matthias Dehmer, Izudin Redžepović, Niko Tratnik, Petra Žigert

Publication date 15 September 2026

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2026.130179

Mathematics Subject Classification ID

Vertex degrees (05C07) Distance in graphs (05C12) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Chemical graph theory (05C92) Measures of information, entropy (94A17)

Cites work

• A survey of graph edit distance
• Collective dynamics of `small-world' networks
• Comparing large graphs efficiently by margins of feature vectors
• Divergence measures based on the Shannon entropy
• Efficient graph similarity assessment method based on vectors of topological indices
• Fifty years of graph matching, network alignment and network comparison
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• Networks. An introduction.
• Neue Begründung der Theorie quadratischer Formen von unendlichvielen Veränderlichen.
• On a certain distance between isomorphism classes of graphs
• On efficient network similarity measures
• On Information and Sufficiency
• On some counting polynomials in chemistry
• Properties of graph distance measures by means of discrete inequalities
• Statistical mechanics of complex networks

This page was built for publication: A distribution-based framework for network similarity assessment

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