# HG changeset patch
# User Alpar Juttner <alpar@cs.elte.hu>
# Date 1480544803 -3600
# Node ID 497868c58d361c9a155c540c51e997783e4592df
# Parent  217340b8dec7152282446156e4735b4f574258ec# Parent  42fbe17f0e3b414d568c074e66ff51a335e6c1a9
Merge

diff -r 217340b8dec7 -r 497868c58d36 damecco.tex
--- a/damecco.tex	Wed Nov 30 23:20:34 2016 +0100
+++ b/damecco.tex	Wed Nov 30 23:26:43 2016 +0100
@@ -180,7 +180,7 @@
 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
@@ -262,7 +262,7 @@
 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