Weighted Mean of a Pair of Graphs
- Cite this article as:
- Bunke, H. & Günter, S. Computing (2001) 67: 209. doi:10.1007/s006070170006
- 78 Downloads
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.