From 1f78835fd3bc22a115782347d2df1ac371966db2 Mon Sep 17 00:00:00 2001
From: Antti H S Laaksonen <ahslaaks@cs.helsinki.fi>
Date: Sat, 11 Feb 2017 21:27:03 +0200
Subject: [PATCH] Corrections

---
 luku27.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/luku27.tex b/luku27.tex
index 520ba89..65050b5 100644
--- a/luku27.tex
+++ b/luku27.tex
@@ -295,7 +295,7 @@ we go through all pairs of nodes whose
 color is $x$ and select the pair that
 has the maximum 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
 nodes is $O(n \sqrt n)$.