bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Corrections

This commit is contained in:
Antti H S Laaksonen 2017-02-11 21:27:03 +02:00
parent 1e4c77253c
commit 1f78835fd3
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
luku27.tex
View File

@ -295,7 +295,7 @@ we go through all pairs of nodes whose
color is $x$ and select the pair that color is $x$ and select the pair that
has the maximum distance. has the maximum distance.
For each node, it is needed to calculate the distance For each node, it is needed to calculate the distance
to $O(\sqrt n)$ other nodes (see 18.3), to $O(\sqrt n)$ other nodes (see Chapter 18.3),
so the total time needed for processing all so the total time needed for processing all
nodes is $O(n \sqrt n)$. nodes is $O(n \sqrt n)$.