Avancées dans la traduction de l'intro

[rairo15.git] / stopping.tex

diff --git a/stopping.tex b/stopping.tex
index 96fd41bce908524622db7243fcc3b079bd633b04..0ad3e8a7bffba16803c5a9c8d0700e8cb6fbd0cc 100644 (file)
--- a/stopping.tex
+++ b/stopping.tex
@@ -345,4 +345,10 @@ Theorem~\ref{prop:stop} is a direct application of
 lemma~\ref{prop:lambda} and~\ref{lm:stopprime}.
 \end{proof}
 
 lemma~\ref{prop:lambda} and~\ref{lm:stopprime}.
 \end{proof}
 

-
+Notice that the calculus of the stationary time upper bound is obtained
+under the following constraint: for each vertex in the $\mathsf{N}$-cube 
+there are one ongoing arc and one outgoing arc that are removed. 
+The calculus does not consider (balanced) hamiltonian cycles, which 
+are more regular and more binding than this constraint.
+In this later context, we claim that the upper bound for the stopping time 
+should be reduced.