SET TO SET BROADCASTING IN COMMUNICATION-NETWORKS

檔案

日期

1992-12-14

類型

期刊名稱

DISCRETE APPLIED MATHEMATICS

卷期與頁次

第 40 卷第 3 期,頁 411–421

ISSN

0166-218X

語言

英文

摘要

Suppose G = (V,E) is a graph whose vertices represent people and edges represent telephone lines between pairs of people. Each person knows a unique message and is ignorant of the messages of other people at the beginning. These messages are then spread by telephone calls. In each call, two people exchange all information they have so far in exactly one unit of time. Suppose A and B are two nonempty subsets of V. The main purpose of this paper is to study the minimum number b(A,B,G) of telephone calls by which A broadcasts to B; and the minimum time t(A,B,G) such that A broadcasts to B. In particular, we give an exact formula for b(A,B,K(n)) and linear-time algorithms for computing b(A,B,T) and t(A,B,T) of a tree T.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

LEE, H., & CHANG, G. (1992). SET TO SET BROADCASTING IN COMMUNICATION-NETWORKS. DISCRETE APPLIED MATHEMATICS, 40(3), 411–421. https://ir.lib.nycu.edu.tw/handle/11536/3210

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/3210