Share Your Research, Maximize Your Social Impacts
The All-Ones Problem for Binomial Trees, Butterfly and Benes Networks
Journal: International Journal of Mathematics and Soft Computing (Vol.2, No. 2)Publication Date: 2012-07-22
Authors : Paul Manuel Indra Rajasingh Bharathi Rajan R. Prabha;
Page : 1-6
Keywords : all-ones problem; dominating set; binomial trees; butterfly networkshttp://ijmsc.com/index.php/ijmsc/article/view/2-2-1/pdf;
Source : Download
Find it from : Google Scholar
Abstract
The all-ones problem is an NP-complete problem introduced by Sutner [11], with wide applications in linear cellular automata. In this paper, we solve the all-ones problem for some of the widely studied architectures like binomial trees, butterfly, and benes networks.
Other Latest Articles
- Characterization of complementary connected domination number of a graph
- M / M (k) /1 Queuing model with varying bulk service
- Labeling of finite union of paths
- Minimum cycle covers of Butterfly and Benes networks
- Harvesting and Hopf Bifurcation in a prey-predator model with Holling Type IV Functional Response
Last modified: 2013-08-24 02:06:46