1.1 --- a/damecco.tex	Wed Nov 30 23:20:34 2016 +0100
     1.2 +++ b/damecco.tex	Wed Nov 30 23:26:43 2016 +0100
     1.3 @@ -180,7 +180,7 @@
     1.4  edges to chemical bonds. The similarity and dissimilarity of
     1.5  objects corresponding to nodes are incorporated to the model
     1.6  by \emph{node labels}. Understanding such networks basically
     1.7 -requires finding specific subgraphs, thus calls for efficient
     1.8 +requires finding specific subgraphs, thus it calls for efficient
     1.9  graph matching algorithms.
    1.10  
    1.11  Other real-world fields related to some
    1.12 @@ -262,7 +262,7 @@
    1.13  details necessary for an efficient implementation are discussed in
    1.14  Section~\ref{sec:VF2ppImpl}.  Finally, Section~\ref{sec:ExpRes}
    1.15  provide a detailed experimental evaluation of VF2++ and its comparison
    1.16 -to the state-of-the-art algorithms.
    1.17 +to the state-of-the-art algorithm.
    1.18  
    1.19  It must also be mentioned that the C++ implementations of the
    1.20  algorithms have been made available for evaluation and use under an