Weighted mean of a pair of graphs

DOI10.1007/S006070170006MaRDI QIDQ5958908zbMATH OpenOpenAlexFDO

Authors Horst Bunke, Simon Günter

Publication date 20 March 2002

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s006070170006

zbMATH Keywords

generalized mediangraph edit distanceself-organizing mapweighted mean

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10)

Recommendations

• scientific article; zbMATH DE number 1691467
• An edit distance between graph correspondences
• A survey of graph edit distance
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• Structural pattern recognition with graph edit distance. Approximation algorithms and applications

Cited in

(7)

• Statistical graph space analysis
• Mean graphs
• scientific article; zbMATH DE number 1691467 (Why is no real title available?)
• A Recursive Embedding Approach to Median Graph Computation
• An edit distance between graph correspondences
• Ensemble clustering by means of clustering embedding in vector spaces
• Generalized median graph computation by means of graph embedding in vector spaces

This page was built for publication: Weighted mean of a pair of graphs

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