Author:
Bagchi A.,Schmeichel E. F.,Hakimi S. L.
Subject
Computer Networks and Communications,Hardware and Architecture,Information Systems,Software
Reference7 articles.
1. Some additional results on gossiping with packets. Unpublished manuscript (1990).
2. On the complexity of partitioning graphs into connected subgraphs
3. and , Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979).
4. The general gossip problem. IBM Research Report 4977 (1974).
5. The communication problem on graphs and digraphs
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献