A metric on the space of weighted graphs
classification
🧮 math.MG
keywords
metricspacedistancegraphgraphsnormrecognitionsome
read the original abstract
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main result is the completeness of the space. Some other analytical properties of this space are also investigated. The introduced metric could have some applications in pattern recognition and face recognition methods.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.