
diff -r 196396ea94b5 -r 8349e9e65e18 damecco.tex
--- a/damecco.tex	Fri Nov 25 23:47:31 2016 +0100
+++ b/damecco.tex	Sat Nov 26 00:15:22 2016 +0100
@@ -832,8 +832,8 @@
 
 \subsection{Cutting rules}
 \label{VF2PPCuttingRules}
-This section presents the cutting rules of VF2++, which are improved
-by using extra information coming from the node labels.
+This section presents the cutting rule of VF2++ in the case of IND, which is improved
+by using extra information coming from the node labels. For other problem types, the rules can be formulated similarly.
 \begin{notation}
 Let $\mathbf{\Gamma_{small}^{l}(u)}:=\{\tilde{u} : lab(\tilde{u})=l
 \wedge \tilde{u}\in \Gamma_{small} (u)\}$ and
@@ -842,22 +842,10 @@
 V_{large}$ and $l$ is a label.
 \end{notation}
 
-\subsubsection{Induced subgraph isomorphism}
 \begin{claim}
 \[LabCut_{IND}((u,v),M(s))\!:=\!\!\!\!\!\bigvee_{l\ is\ label}\!\!\!\!\!\!\!|\Gamma_{large}^{l} (v) \cap T_{large}(s)|\!<\!|\Gamma_{small}^{l}(u)\cap T_{small}(s)|\ \vee\]\[\bigvee_{l\ is\ label} \newline |\Gamma_{large}^{l}(v)\cap \tilde{T}_{large}(s)| < |\Gamma_{small}^{l}(u)\cap \tilde{T}_{small}(s)|\] is a cutting function by IND.
 \end{claim}
 
-\subsubsection{Graph isomorphism}
-\begin{claim}
-\[LabCut_{ISO}((u,v),M(s))\!:=\!\!\!\!\!\bigvee_{l\ is\ label}\!\!\!\!\!\!\!|\Gamma_{large}^{l} (v) \cap T_{large}(s)|\!\neq\!|\Gamma_{small}^{l}(u)\cap T_{small}(s)|\  \vee\]\[\bigvee_{l\ is\ label} \newline |\Gamma_{large}^{l}(v)\cap \tilde{T}_{large}(s)| \neq |\Gamma_{small}^{l}(u)\cap \tilde{T}_{small}(s)|\] is a cutting function by ISO.
-\end{claim}
-
-\subsubsection{Subgraph isomorphism}
-\begin{claim}
-\[LabCut_{SUB}((u,v),M(s))\!:=\!\!\!\!\!\bigvee_{l\ is\ label}\!\!\!\!\!\!\!|\Gamma_{large}^{l} (v) \cap T_{large}(s)|\!<\!|\Gamma_{small}^{l}(u)\cap T_{small}(s)|\] is a cutting function by SUB.
-\end{claim}
-
-
 
 \subsection{Implementation details}
 This section provides a detailed summary of an efficient




