HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm

Gholami, Saber; Harutyunyan, Hovhannes A.

doi:10.23919/jcn.2022.000051

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article3

Other1

Preprint1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

References 93 publications

(200 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

Finding broadcast 2-centers of a tree under the postal model

Tsou,

Lin,

Hsu

2024

Discrete Applied Mathematics

View full text Add to dashboard Cite

Finding broadcast 2-centers of a tree under the postal model

Tsou,

Lin,

Hsu

2024

Discrete Applied Mathematics

View full text Add to dashboard Cite

A Note to Non-adaptive Broadcasting

Gholami,

Harutyunyan

2024

Parallel Process. Lett.

View full text Add to dashboard Cite

Broadcasting is a fundamental problem in the information dissemination area. In classical broadcasting, a message must be sent from one network member to all other members as rapidly as feasible. Although it has been demonstrated that this problem is NP-Hard for arbitrary graphs, it has several applications in various fields. As a result, the universal lists model, replicating real-world restrictions like the memory limits of nodes in large networks, is introduced as a branch of this problem in the literature. In the universal lists model, each node is equipped with a fixed list and has to follow the list regardless of the originator. In this study, we focus on the non-adaptive branch of universal lists broadcasting. In this regard, we establish the optimal broadcast time of [Formula: see text]-ary trees and binomial trees under the non-adaptive model and provide an upper bound for complete bipartite graphs. We also improved a general upper bound for trees under the same model and showed that our upper bound cannot be improved in general.

show abstract