Encompassing Computer Science Workshop 2015

Details for Enes Pasalic

Title: Prof.

Affiliation: University of Primorska

Author in the following contribution

• Solving an NP hard problem of finding independent dominating sets of minimum cardinality for hypercube graphs of size 2^n with n=2^r-1