Connectivity and inference problems for temporal networks

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 504-513

  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

ALGORITHMIC PROBLEMS; ALGORITHMIC PROPERTIES; CONNECTIVITY PROBLEMS; DISTRIBUTED NETWORKS; INFERENCE PROBLEM; NODE-DISJOINT PATHS; POLYNOMIAL-TIME ALGORITHMS; TEMPORAL NETWORKS;

ALGORITHMS; COMPUTATION THEORY; FLOW GRAPHS; GRAPHIC METHODS; COMPUTATIONAL COMPLEXITY;

GRAPH THEORY;

TEMPORAL NETWORKS;

EID: 0033708136     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335364     Document Type: Conference Paper

References (18)

1. N. Bailey, The Mathematical Theory of Infectious Diseases and its Applications, Hafner Press, 1975.
2. B. Baker, R. Shostak, "Gossips and telephones," Discrete Mathematics 2(1972), pp. 191-193.
3. K. Berman, "Vulnerability of scheduled networks and a generalization of Menger's Theorem," Networks 28(1996), pp. 125-134.
4. R. Bumby, "A problem with telephones," SIAM J. Algebraic and Discrete Methods 2(1981), pp. 18-31.
5. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Stuygis, D. Swinehart, D. Terry, "Epidemic algorithms for replicated database maintenance," Proc. ACM Symp. on Operating Systems Principles, 1987.
6. S. Fortune, J. Hopcroft, J. Wyllie, "The directed subgraph homeomorphism problem," Theoretical Computer Science 10(1980), pp. 111-121.
7. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, M. Yannakakis, "Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems," Proc. ACM Symposium on Theory of Computing, 1999, pp. 19-28.
8. A. Hajnal, E. Miller, E. Szemerédi, "A cure for the telephone disease," Canadian Math. Bulletin 15(1972), pp. 447-450.
9. S. Hedetniemi, S. Hedetniemi, A. Liestman, "A survey of gossiping and broadcasting in communication networks," Networks 18(1988), pp. 319-349.
10. R.M. Karp, "On the computational complexity of combinatorial problems," Networks 5(1975), pp. 45-68.
11. K. Kuratowski, "Sur le problème des courbes gauches en topologie," Fundam. Math. 15 (1930), pp. 271-283.
12. C. Li, T. McCormick, D. Simchi-Levi, "The complexity of finding two disjoint paths with min-max objective function," Discrete Appl. Math. 26(1990), pp. 105-115
13. K. Menger, "Zur allgemeinen Kurventheorie," Fundam. Math. 19(1927), pp. 96-115.
14. Y. Minsky, personal communication, April 1999.
15. R. Ravi, "Rapid rumor ramification: Approximating the minimum broadcast time," Proc. IEEE FOCS, 1994.
16. R. van Renesse, Y. Minsky, M. Hayden, "A gossip-style failure-detection service," Proc. IFIP 1996.
17. N. Robertson, P.D. Seymour, "Graph Minors XIII. The disjoint paths problem," J. Combinatorial Theory Ser. B 63(1995), pp. 65-110.
18. R. Tijdeman, "On a telephone problem," Nieuw Arch. Wisk. 19(1971), pp. 188-192.