The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics
Label-connected graphs and the gossip problem
Discrete Mathematics
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Message Multicasting in Heterogeneous Networks
SIAM Journal on Computing
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Spatial gossip and resource location protocols
Journal of the ACM (JACM)
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Temporal distance metrics for social network analysis
Proceedings of the 2nd ACM workshop on Online social networks
Characterising temporal distance and reachability in mobile and online social networks
ACM SIGCOMM Computer Communication Review
Meaningful selection of temporal resolution for dynamic networks
Proceedings of the Eighth Workshop on Mining and Learning with Graphs
Finding spread blockers in dynamic networks
SNAKDD'08 Proceedings of the Second international conference on Advances in social network mining and analysis
Discovering the Evolutionary Patterns in Local Topology of an E-Mail Social Network
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Dissemination in opportunistic social networks: the role of temporal communities
Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing
On the exploration of time-varying networks
Theoretical Computer Science
A Probabilistic Approach to Structural Change Prediction in Evolving Social Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Benefits of network coding for unicast application in disruption-tolerant networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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 network. To model the notion that information in such a network "flows" only on paths whose labels respect the ordering of time, we call a path time-respecting if the time labels on its edges are non-decreasing. The central motivation for our work is the following question: how do the basic combinatorial and algorithmic properties of graphs change when we impose this additional temporal condition? The notion of a path is intrinsic to many of the most fundamental algorithmic problems on graphs; spanning trees, connectivity, flows, and cuts are some examples. When we focus on time-respecting paths in place of arbitrary paths, many of these problems acquire a character that is different from the traditional setting, but very rich in its own right. We provide results on two types of problems for temporal networks. First, we consider connectivity problems, in which we seek disjoint time-respecting paths between pairs of nodes. The natural analogue of Menger's Theorem for node-disjoint paths fails in general for time-respecting paths; we give a non-trivial characterization of those graphs for which the theorem does hold in terms of an excluded subdivision theorem, and provide a polynomial-time algorithm for connectivity on this class of graphs. (The problem on general graphs is NP-complete.) We then define and study the class of inference problems, in which we seek to reconstruct a partially specified time labeling of a network in a manner consistent with an observed history of information flow.