IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v325y2018icp15-23.html
   My bibliography  Save this article

Modelling simultaneous broadcasting by level-disjoint partitions

Author

Listed:
  • Gregor, Petr
  • Škrekovski, Riste
  • Vukašinović, Vida

Abstract

Simultaneous broadcasting of multiple messages from the same source vertex in synchronous networks is considered under restrictions that each vertex receives at most one message in a unit time step, every received message can be sent out only in the next time step, no message is sent to already informed vertices. The number of outgoing messages is unrestricted, messages have unit length, and we assume full-duplex mode. In Gregor et al. (2015), we developed a concept of level-disjoint partitions to study simultaneous broadcasting under this model. In this work, we consider the optimal number of level-disjoint partitions. We also provide a necessary condition in terms of eccentricity and girth on existence of k v-rooted level-disjoint partitions of optimal height. In particular, we provide a structural characterization of graphs admitting two level-disjoint partitions with the same root.

Suggested Citation

  • Gregor, Petr & Škrekovski, Riste & Vukašinović, Vida, 2018. "Modelling simultaneous broadcasting by level-disjoint partitions," Applied Mathematics and Computation, Elsevier, vol. 325(C), pages 15-23.
    • Handle: RePEc:eee:apmaco:v:325:y:2018:i:c:p:15-23
    DOI: 10.1016/j.amc.2017.12.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300317308779
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2017.12.018?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    3. 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.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    1. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.

    Corrections

    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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.