Generating Tree Decomposition of Graphs with Imperialist Competitive Algorithm for Use in Secret Sharing Scheme
M Rajaati Bavil Olyaei… - Electronic and Cyber …, 2019 - ecdj.ihu.ac.ir
Secret sharing refers to methods of distributing a secret amongst a group of participants,
each of whom is assigned with a share of the secret. The secret can be reconstructed only …
each of whom is assigned with a share of the secret. The secret can be reconstructed only …
On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
M Hashemipour, MR Hooshmandasl… - arXiv preprint arXiv …, 2018 - arxiv.org
Let $ G=(V, E) $ be a graph. A subset $ S\subseteq V $ is a dominating set of $ G $ if every
vertex not in $ S $ is adjacent to a vertex in $ S $. A set $\tilde {D}\subseteq V $ of a graph …
vertex not in $ S $ is adjacent to a vertex in $ S $. A set $\tilde {D}\subseteq V $ of a graph …