The exact gossiping problem for seven messages
This paper studies variation of the gossiping problem, where there are n persons, each one initially has a message. A pair can disseminate all messages they have by making one call. The exact gossiping problem is to determine the minimum number of calls each person to know exactly k messages. This i...
| Հիմնական հեղինակ: | |
|---|---|
| Ձևաչափ: | Թեզիս |
| Լեզու: | անգլերեն |
| Հրապարակվել է: |
2008
|
| Խորագրեր: |