Modelling simultaneous broadcasting by level-disjoint partitions
Author
Abstract
Suggested Citation
DOI: 10.1016/j.amc.2017.12.018
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Sun-Yuan Hsieh & Pei-Yu Yu, 2007. "Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges," Journal of Combinatorial Optimization, Springer, vol. 13(2), pages 153-162, February.
- Gregor, Petr & Škrekovski, Riste & Vukašinović, Vida, 2015. "Rooted level-disjoint partitions of Cartesian products," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 244-258.
- Chang, Yu-Huei & Yang, Jinn-Shyong & Chang, Jou-Ming & Wang, Yue-Li, 2015. "A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes," Applied Mathematics and Computation, Elsevier, vol. 268(C), pages 489-495.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Petr Gregor & Riste Škrekovski & Vida Vukašinović, 2018. "Broadcasting multiple messages in the 1-in port model in optimal time," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1333-1355, November.
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.- Gregor, Petr & Škrekovski, Riste & Vukašinović, Vida, 2015. "Rooted level-disjoint partitions of Cartesian products," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 244-258.
- Fister, Iztok & Tepeh, Aleksandra & Fister Jr., Iztok, 2016. "Epistatic arithmetic crossover based on Cartesian graph product in ensemble differential evolution," Applied Mathematics and Computation, Elsevier, vol. 283(C), pages 181-194.
- Petr Gregor & Riste Škrekovski & Vida Vukašinović, 2018. "Broadcasting multiple messages in the 1-in port model in optimal time," Journal of Combinatorial Optimization, Springer, vol. 36(4), pages 1333-1355, November.
- Tz-Liang Kueng & Cheng-Kuan Lin & Tyne Liang & Jimmy J. M. Tan & Lih-Hsing Hsu, 2009. "A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges," Journal of Combinatorial Optimization, Springer, vol. 17(3), pages 312-322, April.
- Tzu-Liang Kung & Cheng-Kuan Lin & Lih-Hsing Hsu, 2014. "On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube," Journal of Combinatorial Optimization, Springer, vol. 27(2), pages 328-344, February.
More about this item
Keywords
Simultaneous broadcasting; Multiple message broadcasting; Level-disjoint partitions; Interconnection networks;All these keywords.
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:eee:apmaco:v:325:y:2018:i:c:p:15-23. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.