|
|||||
|
|
Weighted Mean of a Pair of Graphs |
|
| Authors: | Horst Bunke Simon Günter |
| Affiliation: | (1) Department of Computer Science University of Bern Neubrückstr. 10 CH-3012 Bern Switzerland e-mail: bunke@iam.unibe.ch, CH;(2) Department of Computer Science University of Bern Neubrückstr. 10 CH-3012 Bern Switzerland e-mail: sguenter@iam.unibe.ch, CH |
| Abstract: | 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. Received April 9, 2001 |
| Keywords: | AMS Subject Classifications: 05c99 68R10 68T10. |
| 本文献已被 SpringerLink 等数据库收录！ | |