Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Simple, strict, proper, happy: A study of reachability in temporal graphs (2208.01720v4)

Published 2 Aug 2022 in cs.DM and cs.DC

Abstract: Dynamic networks are a complex subject. Not only do they inherit the complexity of static networks (as a particular case); they are also sensitive to definitional subtleties that are a frequent source of confusion and incomparability of results in the literature. In this paper, we take a step back and examine three such aspects in more details, exploring their impact in a systematic way; namely, whether the temporal paths are required to be \emph{strict} (i.e., the times along a path must increasing, not just be non-decreasing), whether the time labeling is \emph{proper} (two adjacent edges cannot be present at the same time) and whether the time labeling is \emph{simple} (an edge can have only one presence time). In particular, we investigate how different combinations of these features impact the expressivity of the graph in terms of reachability. Our results imply a hierarchy of expressivity for the resulting settings, shedding light on the loss of generality that one is making when considering either combination. Some settings are more general than expected; in particular, proper temporal graphs turn out to be as expressive as general temporal graphs where non-strict paths are allowed. Also, we show that the simplest setting, that of \emph{happy} temporal graphs (i.e., both proper and simple) remains expressive enough to emulate the reachability of general temporal graphs in a certain (restricted but useful) sense. Furthermore, this setting is advocated as a target of choice for proving negative results. We illustrates this by strengthening two known results to happy graphs (namely, the inexistence of sparse spanners, and the hardness of computing temporal components). Overall, we hope that this article can be seen as a guide for choosing between different settings of temporal graphs, while being aware of the way these choices affect generality.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (37)
  1. Temporal flows in temporal networks. Journal of Computer and System Sciences, 103:46–60, 2019.
  2. The complexity of optimal design of temporally connected graphs. Theory of Computing Systems, 61(3):907–944, 2017.
  3. On implementing stabilizing leader election with weak assumptions on network dynamics. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 21–31, 2021.
  4. On the size and the approximability of minimum temporally connected subgraphs. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP), pages 149:1–149:14, 2016.
  5. Cops and robbers on dynamic graphs: Offline and online case. Discrete Mathematics & Theoretical Computer Science, 25(Discrete Algorithms), 2023.
  6. Testing temporal connectivity in sparse dynamic graphs. arXiv preprint arXiv:1404.7634, 2014.
  7. Parsimonious flooding in dynamic graphs. Distributed Computing, 24(1):31–44, 2011.
  8. Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In International Conference on Ad-Hoc Networks and Wireless, pages 259–270. Springer, 2003.
  9. Sparse temporal spanners with low stretch. arXiv preprint arXiv:2206.11113, 2022.
  10. The complexity of data aggregation in static and dynamic wireless sensor networks. In Symposium on Self-Stabilizing Systems, pages 36–50. Springer, 2015.
  11. A dynamic data structure for temporal reachability with unsorted contact insertions. Social Network Analysis and Mining, 12(1):1–12, 2022.
  12. On computing pareto optimal paths in weighted time-dependent networks. Inf. Process. Lett., 168:106086, 2021.
  13. Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(02):267–285, 2003.
  14. Richard T. Bumby. A problem with telephones. SIAM Journal on Algebraic Discrete Methods, 2(1), 1979.
  15. Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems, 27(5):387–408, 2012.
  16. Finding temporal paths under waiting time constraints. Algorithmica, 83(9):2754–2802, 2021.
  17. Computing parameters of sequence-based dynamic graphs. Theory of Computing Systems, 63:394–417, 2019.
  18. Temporal cliques admit sparse spanners. Journal of Computer and System Sciences, 121:1–17, 2021.
  19. Sharp thresholds in random simple temporal graphs. In 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pages 319–326. IEEE, 2022.
  20. Václav Chvátal and J Komlós. Some combinatorial theorems on monotonicity. Canadian Mathematical Bulletin, 14(2):151–157, 1971.
  21. Enumeration of sd separators in dags with application to reliability analysis in temporal graphs. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020.
  22. On computing large temporal (unilateral) connected components. In International Workshop on Combinatorial Algorithms, pages 282–293. Springer, 2023.
  23. Distributed exploration of dynamic rings. Distributed Computing, 33(1):41–67, 2020.
  24. Deleting edges to restrict the size of an epidemic in temporal networks. In 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019.
  25. Counting temporal paths. arXiv preprint arXiv:2202.12055, 2022.
  26. Parameterized temporal exploration problems. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (SAND 2022). Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2022.
  27. Temporal graph classes: A view through temporal separators. Theoretical Computer Science, 806:197–218, 2020.
  28. A connectivity model for agreement in dynamic systems. In European Conference on Parallel Processing, pages 333–345. Springer, 2015.
  29. Exploration of constantly connected dynamic graphs based on cactuses. In International Colloquium on Structural Information and Communication Complexity, pages 250–262. Springer, 2014.
  30. Connectivity and inference problems for temporal networks. Journal of Computer and System Sciences, 64(4):820–842, 2002.
  31. A constructive proof of vizing’s theorem. In Information Processing Letters. Citeseer, 1992.
  32. A timecop’s chase around the table. In 46th International Symposium on Mathematical Foundations of Computer Science, 2021.
  33. Minimum weight paths in time-dependent networks. Networks, 21(3):295–319, 1991.
  34. Strongly connected components in stream graphs: Computation and experimentations. In International Conference on Complex Networks and Their Applications, pages 568–580. Springer, 2020.
  35. Temporally connected components. Available at SSRN 4590651, 2023.
  36. A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs. Discrete Applied Mathematics, 296:203–216, 2021.
  37. Temporal reachability graphs. In Proceedings of the 18th annual international conference on Mobile computing and networking, pages 377–388, 2012.
Citations (12)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets