Connectivity and inference problems for temporal networks
暂无分享,去创建一个
[1] Robbert van Renesse,et al. A Gossip-Style Failure Detection Service , 2009 .
[2] Sudipto Guha,et al. Message Multicasting in Heterogeneous Networks , 2000, SIAM J. Comput..
[3] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.
[4] K. Berman. Vulnerability of scheduled networks and a generalization of Menger's Theorem , 1996, Networks.
[5] R. Ravi,et al. Rapid rumor ramification: approximating the minimum broadcast time , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[6] Chung-Lun Li,et al. The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..
[7] Arthur L. Liestman,et al. A survey of gossiping and broadcasting in communication networks , 1988, Networks.
[8] Scott Shenker,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[9] R. Bumby. A Problem with Telephones , 1981 .
[10] John E. Hopcroft,et al. The Directed Subgraph Homeomorphism Problem , 1978, Theor. Comput. Sci..
[11] N. Ling. The Mathematical Theory of Infectious Diseases and its applications , 1978 .
[12] E. C. Milner,et al. A Cure for the Telephone Disease , 1972, Canadian Mathematical Bulletin.
[13] Brenda S. Baker,et al. Gossips and telephones , 1972, Discret. Math..
[14] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[15] J. Orestes Cerdeira,et al. Label-connected graphs and the gossip problem , 1991, Discret. Math..
[16] Alexander Grey,et al. The Mathematical Theory of Infectious Diseases and Its Applications , 1977 .
[17] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.
[18] Walter Knödel,et al. New gossips and telephones , 1975, Discret. Math..
[19] C. Kuratowski. Sur le problème des courbes gauches en Topologie , 1930 .
[20] K. Menger. Zur allgemeinen Kurventheorie , 1927 .