Minimum multiple originator broadcast graphs
| Autor: | Dana Richards, Arthur L. Liestman |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
business.industry
Applied Mathematics Minimum time 0211 other engineering and technologies 021107 urban & regional planning 0102 computer and information sciences 02 engineering and technology Broadcasting 16. Peace & justice 01 natural sciences Graph Combinatorics 010201 computation theory & mathematics Computer Science::Networking and Internet Architecture Discrete Mathematics and Combinatorics business MathematicsofComputing_DISCRETEMATHEMATICS Computer Science::Information Theory Mathematics |
| Zdroj: | Discrete Applied Mathematics. 216:646-661 |
| ISSN: | 0166-218X |
| DOI: | 10.1016/j.dam.2016.06.015 |
| Popis: | Broadcasting from multiple originators is a variant of broadcasting in which any k vertices may be the originators of a message in a network of n vertices. A minimum broadcast graph has the fewest possible edges while still allowing minimum time broadcasting from any set of k originators. We provide a census of all known such graphs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect