Fault Tolerance and 2-Domination in Certain Interconnection Networks
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- S. Robin & J.-J. Daudin, 2001. "Exact Distribution of the Distances between Any Occurrences of a Set of Words," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 53(4), pages 895-905, December.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Ana Helena Tavares & Jakob Raymaekers & Peter J. Rousseeuw & Paula Brito & Vera Afreixo, 2020. "Clustering genomic words in human DNA using peaks and trends of distributions," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 14(1), pages 57-76, March.
- Vladimir Pozdnyakov & Joseph Glaz & Martin Kulldorff & J. Steele, 2005. "A martingale approach to scan statistics," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 57(1), pages 21-37, March.
- Kiyoshi Inoue & Sigeo Aki, 2009. "On waiting time distributions associated with compound patterns in a sequence of multi-state trials," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 61(2), pages 499-516, June.
- Kiyoshi Inoue & Sigeo Aki, 2014. "On sooner and later waiting time distributions associated with simple patterns in a sequence of bivariate trials," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 77(7), pages 895-920, October.
- Yonil Park & John L. Spouge, 2004. "Searching for Multiple Words in a Markov Sequence," INFORMS Journal on Computing, INFORMS, vol. 16(4), pages 341-347, November.
- V. I. Ilyevsky, 2019. "Recursive Formula for the Random String Word Detection Probability, Overlaps and Probability Extremes," Journal of Mathematics Research, Canadian Center of Science and Education, vol. 11(2), pages 171-180, April.
- Han, Qing & Hirano, Katuomi, 2003. "Waiting time problem for an almost perfect match," Statistics & Probability Letters, Elsevier, vol. 65(1), pages 39-49, October.
More about this item
Keywords
fault tolerance; 2-domination; mesh; cylinder; torus;All these keywords.
JEL classification:
- R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
- Z0 - Other Special Topics - - General
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ibn:jmrjnl:v:11:y:2019:i:2:p:181. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.