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

Strongly -> strong

This commit is contained in:
Antti H S Laaksonen 2017-02-28 22:02:48 +02:00
parent 501b2f5c9a
commit 120c0e974a
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
chapter17.tex
View File

@ -1,4 +1,4 @@
\chapter{Strongly connectivity} \chapter{Strong connectivity}
\index{strongly connected graph} \index{strongly connected graph}
@ -367,7 +367,7 @@ performs two depth-first searches.
\index{2SAT problem} \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 \key{2SAT problem}\footnote{The algorithm presented here was
introduced in \cite{asp79}. introduced in \cite{asp79}.
There is also another well-known linear-time algorithm \cite{eve75} 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 where each part of the formula is of the form
$(a_i \lor b_i \lor c_i)$. $(a_i \lor b_i \lor c_i)$.
This problem is NP-hard, so no efficient algorithm This problem is NP-hard, so no efficient algorithm
for solving the problem is known. for solving the problem is known.