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

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
Is this an NP problem?

Categories

HOME
winforms
vbscript
tinymce
programming-languages
google-oauth
callback
cross-browser
fingerprint
applepay
kibana-4
vault
ghc
after-effects
solaris-10
beyondcompare
autoconf
physics-engine
tokenize
csrf-protection
extjs5
kudan
mmap
icloud-api
microsoft-sync-framework
fish
react-css-modules
tooltipster
neo4j-spatial
delicious-api
madlib
sql-server-2012-express
.net-4.0
webtest
asset-pipeline
revolution-slider
dosbox
event-driven
starteam
ssjs
elasticsearch-plugin
pdf-reactor
scorm
google-datalayer
errordocument
theming
pnotify
sage-one
mplayer
worker-thread
lift-json
crypt
r-forge
flow-control
arrow-keys
mediaelement
background-service
migradoc
cubes
static-ip-address
vmware-tools
probability-density
mongocsharpdriver
photobucket
historian
maven-tomcat-plugin
msys
cartesian-product
purge
tarjans-algorithm
emailrelay
ios9.1
sailfish-os
processmodel
iiviewdeckcontroller
bridge.net
directoryservices
python-green
pick
xc16
camanjs
rdl
responsive-slides
has-many-through
article
tld
poller
picturefill
uv-mapping
blending
quartz-graphics
ril
back-stack
android-screen-support
wsdl-2.0
mhtml
google-email-migration
netbeans-6.9
android-sdk-2.1
radcombobox
libs
project-hosting
putchar
genealogy
django-notification
.net-1.0

Resources

Mobile Apps Dev
Database Users
javascript
java
csharp
php
android
MS Developer
developer works
python
ios
c
html
jquery
RDBMS discuss
Cloud Virtualization
Database Dev&Adm
javascript
java
csharp
php
python
android
jquery
ruby
ios
html
Mobile App
Mobile App
Mobile App