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

Small fixes

Browse source
This commit is contained in:
Antti H S Laaksonen 2017-02-20 23:23:10 +02:00
parent d4ea994907
commit 797035fd8a
13 changed files with 43 additions and 43 deletions
Download patch file Download diff file Expand all files Collapse all files

8
luku19.tex
View file

@ -18,7 +18,7 @@ find a such path if it exists.
On the contrary, checking the existence of a Hamiltonian path is a NP-hard
problem and no efficient algorithm is known for solving the problem.
\section{Eulerian path}
\section{Eulerian paths}
\index{Eulerian path}
@ -391,7 +391,7 @@ to the circuit:
Now all edges are included in the circuit,
so we have successfully constructed an Eulerian circuit.
\section{Hamiltonian path}
\section{Hamiltonian paths}
\index{Hamiltonian path}
@ -521,7 +521,7 @@ The function indicates whether there is a Hamiltonian path
that visits the nodes in $s$ and ends at node $x$.
It is possible to implement this solution in $O(2^n n^2)$ time.
\section{De Bruijn sequence}
\section{De Bruijn sequences}
\index{De Bruijn sequence}
@ -573,7 +573,7 @@ The starting node has $n-1$ characters
and there are $k^n$ characters in the edges,
so the length of the string is $k^n+n-1$.
\section{Knight's tour}
\section{Knight's tours}
\index{knight's tour}