np-complete


Reduction from Maximum independent set to Dominating set to prove the Dominating set is NP-complete


I know of the reduction from the Vertex cover to Dominating set.
However, I was seeing if I could get a reduction from the maximum independent set problem straight to the Dominating set problem in order to prove the latter NP-complete.
Does anyone know if this has been done? I can't find anything online.
I was hoping to find something along the lines of a proof like:
If there is a dominating set of size k -> there is a maximum independent set of size k.
AND
If there is a maximum independent set of size k -> then there is a dominating set of size k.
Yes you can get a reduction from the maximum independent set problem straight to the Dominating set problem -- but not that straight, you need to construct another graph in the following manner. We then can prove that if the original graph has an independent set of size k iff the new graph has a dominating set of some size related to k. The construction is polynomial.
Given a graph G = (V, E) we can construct another graph G' = (V', E') where for each edge e_k = (v_i, v_j) in E, we add a vertex v_{e_k} and two edges (v_i, v_{e_k}) and (v_{e_k}, v_j).
We can prove G has an independent set of size k iff G' has a dominating set of size |V|-k.
(=>) Suppose I is a size-k independent set of G, then V-I must be a size-(|V|-k) dominating set of G'. Since there is no pair of connected vertex in I, then each vertex in I is connected to some vertex in V-I. Moreover, every new added vertex are also connected to some vertices in V-I.
(<=) Suppose D is a size-(|V|-k) independent set of G', then we can safely assume that all vertices in D is in V (since if D contains an added vertex we can replace it by one of its adjacent vertex in V and still have a dominating set of the same size).
We claim V-D is a size-k independent set in G and prove it by contradiction: suppose V-D is not independent and contains a pair of vertices v_i and v_j and the edge e_k = (v_i, v_j) is in E. Then in G' the added vertex v_{e_k} need to be dominated by either v_i or v_j, that is at least one of v_i and v_j is in D. Contradiction. Therefore V-D is a size-k independent set in G.
Combining the two directions you get what you want.

Related Links

Given a graph with n vertices and m edges, does it contain a simple cycle of length ⌈n/2⌉?
NP-complete or NP-hard?
Why using linear integer programming (ILP) though it is NP-Complete?
Prove NP-Completeness of generating 2 shortest routes over given edge grouping constraints?
Reduction to Clique prob
Approximation Algorithm between two NP compete problems
Is it possible to find the probability to a solution of NP-complete problems?
Knapsack for each weight having multiple values - Is it possible to solve?
Reduction from Maximum independent set to Dominating set to prove the Dominating set is NP-complete
How I can prove that 2-CNF is not NP-complete?
When NP complete becomes NP hard
Can it be proven no polynomial algorithm exists for an NP-Complete prob.?
Effect of number base when proving NP completeness of numerical problems
How to reduce 3COLOR to 3SAT?
proof NP-complete
Proof that Dominating Set is NP-Complete

Categories

HOME
compiler-construction
hive
oracle11g
azure-data-factory
server
json.net
read-eval-print-loop
filtering
yarn
malloc
twitter-bootstrap-4
session-variables
maude-system
facebook-php-sdk
etl
jsdoc
http-status-code-504
google-pagespeed
lldb
autocad-plugin
telerik-reporting
android-widget
uninstall
nhapi
typo3-6.2.x
sql-server-2012-express
preg-match
semantic-versioning
hexo
wpf-controls
hot-module-replacement
neuroscience
starteam
vapor
gzipstream
ruby-on-rails-3.1
powershell-dsc
no-www
midl
vao
checkboxlist
revapi
integrity
tropo
directory-structure
libusb-win32
windows-mobile-6.5
bind9
blacklist
firmata
phishing
pcf
py2app
qpid
ready-api
python-stackless
asp.net5
freelancer.com-api
iad
srand
jmeter-maven-plugin
wireshark-dissector
purge
cakephp-3.1
tableau-online
p2
pretty-print
dereference
e10s
formatjs
c3
camanjs
gui-test-framework
nsbutton
id3v2
gulp-less
elliptic-curve
picturefill
didselectrowatindexpath
concurrent-collections
imdbpy
gridfs
sitemesh
apc
file-locking
xamlparseexception
ember-app-kit
drools-planner
unc
trusted
twrequest
subscript
nsdatecomponents
zpt
f#-powerpack
inotifycollectionchanged
pyinotify
mongomapper
asp.net-mvc-areas
getresponsestream
filtered-index
firefox4
virtual-functions
ntvdm.exe

Resources

Encrypt Message