Computing

, Volume 67, Issue 3, pp 209–224

Weighted Mean of a Pair of Graphs

  • Horst Bunke
  • Simon Günter

DOI: 10.1007/s006070170006

Cite this article as:
Bunke, H. & Günter, S. Computing (2001) 67: 209. doi:10.1007/s006070170006

G

and G′, with d(G, G′) being the edit distance of G and G′, the weighted mean of G and G′ is a graph G″ that has edit distances d(G, G″) and d(G″, G′) to G and G′, respectively, such that d(G, G″) + d(G″, G′) = d(G,G′). We'll show formal properties of the weighted mean, describe a procedure for its computation, and give examples.

AMS Subject Classifications: 05c99, 68R10, 68T10. 
Key Words: Graph matching, graph edit distance, weighted mean, generalized median, self organizing map. 

Copyright information

© Springer-Verlag Wien 2001

Authors and Affiliations

  • Horst Bunke
    • 1
  • Simon Günter
    • 2
  1. 1.Department of Computer Science University of Bern Neubrückstr. 10 CH-3012 Bern Switzerland e-mail: bunke@iam.unibe.chCH
  2. 2.Department of Computer Science University of Bern Neubrückstr. 10 CH-3012 Bern Switzerland e-mail: sguenter@iam.unibe.chCH