From 120c0e974a6a449dc2a34008b67980df3b69b8c0 Mon Sep 17 00:00:00 2001 From: Antti H S Laaksonen Date: Tue, 28 Feb 2017 22:02:48 +0200 Subject: [PATCH] Strongly -> strong --- chapter17.tex | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/chapter17.tex b/chapter17.tex index b52dad6..b986b92 100644 --- a/chapter17.tex +++ b/chapter17.tex @@ -1,4 +1,4 @@ -\chapter{Strongly connectivity} +\chapter{Strong connectivity} \index{strongly connected graph} @@ -367,7 +367,7 @@ performs two depth-first searches. \index{2SAT problem} -Strongly connectivity is also linked with the +Strong connectivity is also linked with the \key{2SAT problem}\footnote{The algorithm presented here was introduced in \cite{asp79}. There is also another well-known linear-time algorithm \cite{eve75} @@ -563,4 +563,4 @@ A more difficult problem is the \key{3SAT problem} where each part of the formula is of the form $(a_i \lor b_i \lor c_i)$. This problem is NP-hard, so no efficient algorithm -for solving the problem is known. \ No newline at end of file +for solving the problem is known.