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.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received April 9, 2001
Rights and permissions
About this article
Cite this article
Bunke, H., Günter, S. Weighted Mean of a Pair of Graphs. Computing 67, 209–224 (2001). https://doi.org/10.1007/s006070170006
Issue Date:
DOI: https://doi.org/10.1007/s006070170006