The exact gossiping problem for K>8 messages
This study of the exact gossiping problem extended the results for k ≥ 8 messages. In generating the minimum number of call sequence, a step by step process was created to generate E(n,k), the minimum number of call sequence where n is the number of vertices and k the number of messages, which con...
| Autor Principal: | |
|---|---|
| Formato: | Thesis |
| Idioma: | English |
| Publicado: |
2011
|
| Subjects: |