Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Sign in
Toggle navigation
Menu
Open sidebar
general
albi
Bachelor Mario Surlemont
Commits
a49bd69c
Commit
a49bd69c
authored
May 23, 2020
by
Mario Surlemont
Browse files
Update model.tex
parent
3f5b1976
Changes
1
Hide whitespace changes
Inline
Side-by-side
Latex/model.tex
View file @
a49bd69c
...
@@ -30,6 +30,3 @@ Exponential number as shown in ... $O(3^{n/3})$
...
@@ -30,6 +30,3 @@ Exponential number as shown in ... $O(3^{n/3})$
\subsection
{
Hardness
}
\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.
\\
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.
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment