2018
DOI: 10.1007/s10479-018-2796-0
|View full text |Cite
|
Sign up to set email alerts
|

Efficient approaches for the Flooding Problem on graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…Our approach based on BRKGA is motivated by the success of random‐key algorithms on similar broadcast/flooding problems (Resende, 2011; da Silva et al., 2020), network problems (Reis et al., 2010), and other problems involving transmission (Brandão et al., 2017). To show the effectiveness of the proposed BRKGA, we carry out experiments on instances commonly used in the literature (hypercube, shuffle exchange, cube‐connected cycles, de Bruijn, Harary graphs), and also on massive synthetic instances (up to 1000 vertices), allowing to cover many possibilities of real industry topologies.…”
Section: Introductionmentioning
confidence: 99%
“…Our approach based on BRKGA is motivated by the success of random‐key algorithms on similar broadcast/flooding problems (Resende, 2011; da Silva et al., 2020), network problems (Reis et al., 2010), and other problems involving transmission (Brandão et al., 2017). To show the effectiveness of the proposed BRKGA, we carry out experiments on instances commonly used in the literature (hypercube, shuffle exchange, cube‐connected cycles, de Bruijn, Harary graphs), and also on massive synthetic instances (up to 1000 vertices), allowing to cover many possibilities of real industry topologies.…”
Section: Introductionmentioning
confidence: 99%