m-chrzan.xyz
aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarcin Chrzanowski <mc370754@students.mimuw.edu.pl>2021-12-16 17:05:15 +0100
committerMarcin Chrzanowski <mc370754@students.mimuw.edu.pl>2021-12-16 17:05:15 +0100
commit7f99fac8bd25db9883e916fb2a73a6f9e49f5dd6 (patch)
treeacbf7b9253c7e4c36602c19a1e11abe452a8ad34
parent27c1d117c45622c462f11b648cab1c1d185263f4 (diff)
Specify tree needs to be preprocessed
-rw-r--r--mgr.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/mgr.tex b/mgr.tex
index 0066062..04198e0 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -199,8 +199,8 @@ The rest of our work is organized in the following way:
\ref{relabel-regular-queries} and solving it.
\begin{itemize}
\item Of note, in Section \ref{computing-closure} we show how to
- compute the LCA closure of a set of $m$ tree vertices in time
- $O(m \log m)$.
+ compute the LCA closure of a set of $m$ vertices of a
+ preprocessed tree in time $O(m \log m)$.
\end{itemize}
\end{itemize}