Metric for comparing graphs with ordered vertices based on the maximum common subgraph

N. D. Moskin

Prikladnaâ diskretnaâ matematika, no. 2 (2021), pp. 105-113.

Résumé

The paper is devoted to the methods of comparison and classification of graphs. This direction is known as graph matching. An overview of metrics for comparing graphs based on a maximum common subgraph is given. A graph $\text{mcs}(G, F)$ is a maximal common subgraph of graphs $G$ and $F$ if it is isomorphic to $G' \subseteq G$ and $F' \subseteq F$ and contains the maximum number of vertices. In some tasks (for example, comparing texts), it is important to take into account one more factor: vertex numbering. A modification of the distance based on the maximum common subgraph is proposed, taking into account this factor (each vertex has its own unique number). We determine a function of graphs $G$ and $F$ as follows: $d(G, F) = 1 - \min_{i=1,\dots,k}({|\text{mcs}(g_{\min(i,m)}, f_i)|}/{i})$. Here $|G|$ denotes the number of vertices in $G$, $|G|=m$, $|F|=k$, $m\leq k$; and $g_i$ is the subgraph of $G$ containing vertices with numbers from $1$ to $i$ and all edges of $G$ incident to these vertices (the graphs $f_i$ are defined similarly). It is shown that this function satisfies all the properties of the metric (nonnegativity, identity, symmetry, triangle inequality). This metric can be used to solve various problems of image recognition (for example, to establish the authorship of texts).

Détail

Keywords: graph, comparison, metric, maximum common subgraph, graph matching.

Bibliographie

[1] Conte D., Foggia P., Sansone C., Vento M., “Thirty years of graph matching in pattern recognition”, Int. J. Pattern Recognit. Artif. Intell., 18:3 (2004), 265–298

[2] Sharma H., Pawar A., Chourasia C., Khatri S., “Implementation of face recognition system based on elastic bunch graph matching”, Intern. J. Engineering Sciences Research Technology (IJESRT), 5:3 (2016), 888–895

[3] Schirmer S., Ponty Y., Giegerich R., “Introduction to RNA secondary structure comparison”, RNA Sequence, Structure, and Function: Computational and Bioinformatic Methods, Methods in Molecular Biology, 1097, Humana Press, Totowa, NJ, 2014, 247–273

[4] Pawar V., Zaveri M., “K-Means graph database clustering and matching for fingerprint recognition”, Intelligent Information Management, 7:4 (2015), 242–251

[5] Fischer A., Suen C., Frinken V., et al., “A fast matching algorithm for graph-based handwriting recognition”, LNCS, 7877, 2013, 194–203

[6] Ogaard K., Roy H., Kase S., et al., “Discovering patterns in social networks with graph matching algorithms”, LNCS, 7812, 2013, 341–349

[7] Stauffer M., Fischer A., Riesen K., “Speeding-up graph-based keyword spotting in historical handwritten documents”, LNCS, 10310, 2017, 83–93

[8] Rogov A. A., Sedov A. V., Sidorov Y. V., Surovceva T. G., Mathematical Methods for text Attribution, PetrSU Publ., Petrozavodsk, 2014, 96 pp. (in Russian)

[9] Bunke H., Shearer K., “A graph distance metric based on the maximal common subgraph”, Pattern Recognit. Lett., 19:3–4 (1998), 255–259

[10] Wallis W., Shoubridge P., Kraetz M., Ray D., “Graph distances using graph union”, Pattern Recognit. Lett., 22 (2001), 701–704

[11] Bunke H., “On a relation between graph edit distance and maximum common subgraph”, Pattern Recognit. Lett., 18 (1997), 689–694

[12] Kochkarov A. A., Sennikova L. I., “Metric characteristics of dynamic graphs and their application”, Novyye Informatsionnyye Tekhnologii v Avtomatizirovannykh Sistemakh, 18, 2015, 236–241 (in Russian)

[13] Bunke H., Foggia P., Guidobaldi C., et al., “A comparison of algorithms for maximum common subgraph on randomly connected graphs”, LNCS, 2396, 2002, 123–132