From 064add128510bdca6685efc0d8bf57b83bce3c95 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Th=C3=A9ophile=20Bastian?= <contact@tobast.fr>
Date: Tue, 22 Aug 2017 16:43:33 +0200
Subject: [PATCH] Ullmann -- some more

---
 report/report.tex | 6 +++++-
 1 file changed, 5 insertions(+), 1 deletion(-)

diff --git a/report/report.tex b/report/report.tex
index 08ca616..d9e46eb 100644
--- a/report/report.tex
+++ b/report/report.tex
@@ -409,7 +409,11 @@ and an isomorphism has been found; if not, we move on to the next permutation.
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{Pattern-match}
 
-\todo{}
+We finally need to be able to find every occurrence of a given \emph{needle}
+circuit in a bigger \emph{haystack} circuit — at any level in its groups
+hierarchy. This problem is basically graph isomorphism with some specificities,
+and for this purpose I used a classical algorithm for the subgraph isomorphism
+problem, \emph{Ullmann}.
 
 \subsection{Ullmann's algorithm}