David Kempe, Jon Kleinberg, Amit Kumar  Home/Search
Context Related
Links: ACM DBLP | cornell.edu/Info/People/...stoc00tn.ps cornell.edu/home/kleinbe...stoc00tn.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cornell.edu/Info/Peopl...kleinber (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Many network problems are based on fundamental relationships involving time. Consider, for example, the problems of modeling the flow of information through a distributed network, studying the spread of a disease through a population, or analyzing the reachability properties of an airline timetable. In such settings, a natural model is that of a graph in which each edge is annotated with a time label specifying the time at which its endpoints "communicated." We will call such a graph a temporal ... (Update)
Context of citations to this paper: More
.... proving properties of such communication histories is that of temporal networks and strictly time respecting paths in them, proposed in [5, 11] as a means to describe how information spreads through a network over time. A directed temporal network is a pair (G, #) where G =...
.... that the output of the underlying gossip mechanism be considered as an entity of interest in itself, called a temporal network [14]. A temporal network is a graph G = V; E) with edge labels (e) that denote the time at which the two endpoints of the edge communicated...
Cited by: More
Gossip with Malicious Parties - Malkhi, Pavlov, Sella (2003) (Correct)
Protocols and Impossibility Results for Gossip-Based.. - Kempe, Kleinberg (2002) (Correct)
Spatial Gossip and Resource Location Protocols - Kempe, Kleinberg, Demers (2001) (Correct)
Similar documents (at the sentence level):
69.9%: Connectivity and Inference Problems for Temporal Networks.. - Kempe, al. (1999) (Correct)
Active bibliography (related documents): More All
0.5: Gossip is Synteny: Incomplete Gossip and the Syntenic Distance .. - Liben-Nowell (Correct)
0.2: Approximation Algorithms for Disjoint Paths Problems - Kleinberg (1996) (Correct)
0.1: Minimum Linear Gossip Graphs and Maximal Linear (\Delta;.. - Fraigniaud, Peters (1994) (Correct)
Similar documents based on text: More All
0.6: Universal-Stability Results and Performance Bounds .. - Andrews.. (Correct)
0.4: Stability of Load Balancing Algorithms in Dynamic.. - Anshelevich, Kempe (2002) (Correct)
0.3: Maximizing the Spread of Influence through a Social Network - Kempe, Kleinberg, Tardos (2003) (Correct)
Related documents from co-citation: More All
3: A gossip-style failure detection service - van Renesse, Minsky et al. - 1998
3: Scalable and Secure Resource Location - van Renesse - 2000
3: Epidemic algorithms for replicated database maintenance (context) - Demers, Greene et al. - 1988
BibTeX entry: (Update)
D. Kempe, J. Kleinberg, A. Kumar, "Connectivity and Inference Problems for Temporal Networks," Proc. 32nd ACM Symp. Theory of Computing, 2000. 21 http://citeseer.ist.psu.edu/article/kempe00connectivity.html More
@inproceedings{ kempe00connectivity,
author = "David Kempe and Jon Kleinberg and Amit Kumar",
title = "Connectivity and inference problems for temporal networks",
pages = "504--513",
year = "2000",
url = "citeseer.ist.psu.edu/article/kempe00connectivity.html" }
Citations (may not include all citations):262 Epidemic algorithms for replicated database maintenance (context) - Demers, Greene et al. - 1987 ACM DBLP
184 A survey of gossiping and broadcasting in communication netw.. (context) - Hedetniemi, Hedetniemi et al. - 1988
65 The Mathematical Theory of Infectious Diseases and its Appli.. (context) - Bailey - 1975
63 The directed subgraph homeomorphism problem (context) - Fortune, Hopcroft et al. - 1980 ACM DBLP
52 Sur le probleme des courbes gauches en topologie (context) - Kuratowski - 1930
51 Near-Optimal Hardness Results and Approximation Algorithms f.. - Guruswami, Khanna et al. - 1999 ACM DBLP
51 Graph Minors XIII. The disjoint paths problem (context) - Robertson, Seymour - 1995
47 Zur allgemeinen Kurventheorie (context) - Menger - 1927
31 the computational complexity of combinatorial problems (context) - Karp - 1975
26 A gossip-style failure-detection service - van Renesse, Minsky et al. - 1996
25 Rapid rumor ramification: Approximating the minimum broadcas.. (context) - Ravi - 1994
24 Gossips and telephones (context) - Baker, Shostak - 1972
17 A problem with telephones (context) - Bumby - 1981
13 A cure for the telephone disease (context) - Hajnal, Miller et al. - 1972
6 The complexity of finding two disjoint paths with min-max ob.. (context) - Li, McCormick et al. - 1990 ACM
3 a telephone problem (context) - Tijdeman - 1971
2 personal communication (context) - Minsky - 1999
2 Vulnerability of scheduled networks and a generalization of .. (context) - Berman - 1996 DBLP
Documents on the same site (http://www.cs.cornell.edu/Info/People/kleinber/kleinber.html): More
Two Algorithms for Nearest-Neighbor Search in High Dimensions - Kleinberg (1997) (Correct)
Segmentation Problems - Kleinberg, Papadimitriou, Raghavan (1998) (Correct)
Comparing Point Sets under Projection - Huttenlocher, Kleinberg (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC