Skip to main content
SpringerLink
Log in

Weighted Mean of a Pair of Graphs

  • Published:
Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science University of Bern Neubrückstr. 10 CH-3012 Bern Switzerland e-mail: bunke@iam.unibe.ch, , , , , , CH

    Horst Bunke

  2. Department of Computer Science University of Bern Neubrückstr. 10 CH-3012 Bern Switzerland e-mail: sguenter@iam.unibe.ch, , , , , , CH

    Simon Günter

Authors
  1. Horst Bunke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Simon Günter
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received April 9, 2001

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s006070170006

Search

Navigation