2009/06/14 by Hamed Daneshpajouh, Daneshpajouh, Hamed, Hamid Reza Daneshpajouh +3
Computer Science · Mathematics · #Digital Image Processing Techniques #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #Metric Geometry (math.MG)
paper · pdf · doi:10.48550/arxiv.0906.2558
openalex publication_date 2009/06/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.