Commit a49bd69c authored by Mario Surlemont's avatar Mario Surlemont
Browse files

Update model.tex

parent 3f5b1976
......@@ -30,6 +30,3 @@ Exponential number as shown in ... $O(3^{n/3})$
\subsection{Hardness}
Connected k hop dominating set is NP-Hard on general Graphs. It is proven to be solvable in polynomial time on some specific graphs.\\
It is proven to be NP-Hard on planar bipartite Graphs with maximum degree 4.\\
The Connected k hop dominating set with k = 1 is NP-Hard on all planar bipartite graphs. \\
As all of our graphs are planar and bipartite in the case of k = 1 finding an optimal solution is NP-Hard.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment