Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikl. Diskr. Mat., 2021, Number 52, Pages 105–113 (Mi pdm741)  

Applied Graph Theory

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

N. D. Moskin

Petrozavodsk State University, Petrozavodsk, Russia

Abstract: 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 $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,…,k}({|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).

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

DOI: https://doi.org/10.17223/20710410/52/7

Full text: PDF file (564 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 519.17

Citation: N. D. Moskin, “Metric for comparing graphs with ordered vertices based on the maximum common subgraph”, Prikl. Diskr. Mat., 2021, no. 52, 105–113

Citation in format AMSBIB
\Bibitem{Mos21}
\by N.~D.~Moskin
\paper Metric for comparing graphs with ordered vertices based on the maximum common subgraph
\jour Prikl. Diskr. Mat.
\yr 2021
\issue 52
\pages 105--113
\mathnet{http://mi.mathnet.ru/pdm741}
\crossref{https://doi.org/10.17223/20710410/52/7}


Linking options:
  • http://mi.mathnet.ru/eng/pdm741
  • http://mi.mathnet.ru/eng/pdm/y2021/i2/p105

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Прикладная дискретная математика
    Number of views:
    This page:18
    Full text:4

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021