Connectivity and inference problems for temporal networks

DOI10.1145/335305.335364zbMath1296.68015OpenAlexW2086991377MaRDI QIDQ5895205

Amit Kumar, David Kempe, Jon M. Kleinberg

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335364

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (31)

Ranking in evolving complex networks ⋮ Edge-Disjoint Branchings in Temporal Graphs ⋮ Traveling salesman problems in temporal graphs ⋮ A Glimpse at Paul G. Spirakis ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Deleting edges to restrict the size of an epidemic in temporal networks ⋮ On Verifying and Maintaining Connectivity of Interval Temporal Networks ⋮ The complexity of optimal design of temporally connected graphs ⋮ Efficient routing in carrier-based mobile networks ⋮ Causality, influence, and computation in possibly disconnected synchronous dynamic networks ⋮ Temporal flows in temporal networks ⋮ How fast can we reach a target vertex in stochastic temporal graphs? ⋮ Payment scheduling in the interval debt model ⋮ On computing large temporal (unilateral) connected components ⋮ Eulerian walks in temporal graphs ⋮ EVENT GRAPHS: ADVANCES AND APPLICATIONS OF SECOND-ORDER TIME-UNFOLDED TEMPORAL NETWORK MODELS ⋮ Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks ⋮ Temporal Vertex Cover with a Sliding Time Window ⋮ Temporal network optimization subject to connectivity constraints ⋮ Temporal vertex cover with a sliding time window ⋮ Unnamed Item ⋮ The temporal explorer who returns to the base ⋮ Approximating multistage matching problems ⋮ Approximating multistage matching problems ⋮ How fast can we reach a target vertex in stochastic temporal graphs ⋮ Temporal Cliques Admit Sparse Spanners ⋮ Convergecast Tree on Temporal Graphs ⋮ Finding proper time intervals for dynamic network extraction ⋮ A simple rounding scheme for multistage optimization ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective^* ⋮ Königsberg sightseeing: Eulerian walks in temporal graphs

This page was built for publication: Connectivity and inference problems for temporal networks