Connectivity and inference problems for temporal networks

Journal of Computer and System Sciences

Volumn 64, Issue 4, 2002, Pages 820-842

  Kempe, David ^a   Kleinberg, Jon ^a   Kumar, Amit ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPHIC METHODS; INTERPOLATION; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; THEOREM PROVING;

CONNECTIVITY; SMOOTH INTEGERS; SPANNING TREES; TEMPORAL NETWORKS;

PROBLEM SOLVING;

EID: 18144395878     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1006/jcss.2002.1829     Document Type: Article

References (20)

1. N. Bailey, "The Mathematical Theory of Infectious Diseases and its Applications, " Hafner Press, New York, 1975.
2. B. Baker and R. Shostak, Gossips and telephones, Discrete Math. 2 (1972), 191-193.
3. A. Bar-Noy, S. Guha, J. Naor, and B. Schieber, Message multicasting in heterogeneous networks, SIAM J. Comput. 30 (2000), 347-358.
4. K. Berman, Vulnerability of scheduled networks and a generalization of Monger's Theorem, Networks 28 (1996), 125-134.
5. R. Bumby, A problem with telephones, SIAM J. Alg. Discrete Methods 2 (1981), 18-31.
6. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Stuygis, D. Swinehart, and D. Terry, Epidemic algorithms for replicated database maintenance, in "Proc. ACM Symp. on Operating Systems Principles, " 1987.
7. S. Fortune, J. Hopcroft, and J. Wyllie, The directed subgraph homeomorphism problem, Theoret. Comput. Sci. 10 (1980), 111-121.
8. F. Göbel, J. Orestes Cerdeira, and H. J. Veldman, Label-connected graphs and the gossip problem, Discrete Math. 87 (1991), 29-40.
9. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis, Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems, in "Proc. ACM Symposium on Theory of Computing, " pp. 19-28, 1999.
10. A. Hajnal, E. Miller, and E. Szemerćdi, A cure for the telephone disease, Canad. Math. Bull. 15 (1972), 447-450.
11. S. Hedetniemi, S. Hedetniemi, and A. Liestman, A survey of gossiping and broadcasting in communication networks, Networks 18 (1988), 319-349.
12. R. M. Karp, On the computational complexity of combinatorial problems, Networks 5 (1975), 45-68.
13. K. Kuratowski, Sur le problème des courbes gauches en topologie, Fundam. Math. 15 (1930), 271-283.
14. C. Li, T. McCormick, and D. Simchi-Levi, The complexity of finding two disjoint paths with min-max objective function, Discrete Appl. Math. 26 (1990), 105-115.
15. K. Menger, Zur allgemeinen Kurventheorie, Fundam. Math. 19 (1927), 96-115.
16. Y. Minsky, personal communication, April 1999.
17. R. Ravi, Rapid rumor ramification: Approximating the minimum broadcast time, in "Proc. IEEE FOCS, " 1994.
18. R. van Renesse, Y. Minsky, and M. Hayden, A gossip-style failure-detection service, in "Proc. IFIP, " 1996.
19. N. Robertson and P. D. Seymour, Graph Minors XIII. The disjoint paths problem, J. Combat. Theory Ser. B 63 (1995), 65-110.
20. R. Tijdeman, On a telephone problem, Nieuw Arch. Wisk. 19 (1971), 188-192.