lemon-vf2: comparison damecco.tex

equal deleted inserted replaced

-:8aee96bb6cf2
+:0050d7927c3a
 as graphs, for instance, a molecular structure can be
 considered as a graph, whose nodes correspond to atoms and whose
 edges to chemical bonds. The similarity and dissimilarity of
 objects corresponding to nodes are incorporated to the model
 by \emph{node labels}. Understanding such networks basically
-requires finding specific subgraphs, thus calls for efficient
+requires finding specific subgraphs, thus it calls for efficient
 graph matching algorithms.
 Other real-world fields related to some
 variants of graph matching include pattern recognition
 and machine vision \cite{HorstBunkeApplications}, symbol recognition
 solved, Section~\ref{sec:VF2Alg} provides a description of VF2. Based
 on that, Section~\ref{sec:VF2ppAlg} introduces VF2++. Some technical
 details necessary for an efficient implementation are discussed in
 Section~\ref{sec:VF2ppImpl}.  Finally, Section~\ref{sec:ExpRes}
 provide a detailed experimental evaluation of VF2++ and its comparison
-to the state-of-the-art algorithms.
+to the state-of-the-art algorithm.
 It must also be mentioned that the C++ implementations of the
 algorithms have been made available for evaluation and use under an
 open source license as a part of LEMON\cite{LEMON} open source graph
 library.