Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 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

An FTP Algorithm for Temporal Graph Untangling (2307.00786v1)

Published 3 Jul 2023 in cs.DS and cs.SI

Abstract: Several classical combinatorial problems have been considered and analysed on temporal graphs. Recently, a variant of Vertex Cover on temporal graphs, called MinTimelineCover, has been introduced to summarize timeline activities in social networks. The problem asks to cover every temporal edge while minimizing the total span of the vertices (where the span of a vertex is the length of the timestamp interval it must remain active in, minus one). While the problem has been shown to be NP-hard even in very restricted cases, its parameterized complexity has not been fully understood. The problem is known to be in FPT under the span parameter only for graphs with two timestamps, but the parameterized complexity for the general case is open. We settle this open problem by giving an FPT algorithm that is based on a combination of iterative compression and a reduction to the Digraph Pair Cut problem, a powerful problem that has received significant attention recently.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (21)
  1. The temporal explorer who returns to the base. J. Comput. Syst. Sci., 120:179–193, 2021. doi:10.1016/j.jcss.2021.04.001.
  2. Temporal vertex cover with a sliding time window. J. Comput. Syst. Sci., 107:108–123, 2020. doi:10.1016/j.jcss.2019.08.002.
  3. Edge exploration of temporal graphs. In Paola Flocchini and Lucia Moura, editors, Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings, volume 12757 of Lecture Notes in Computer Science, pages 107–121. Springer, 2021. doi:10.1007/978-3-030-79987-8_8.
  4. Riccardo Dondi. Insights into the complexity of disentangling temporal graphs. In Ugo Dal Lago and Daniele Gorla, editors, Proceedings of the 23rd Italian Conference on Theoretical Computer Science, ICTCS 2022, Rome, Italy, September 7-9, 2022, volume 3284 of CEUR Workshop Proceedings, pages 1–13. CEUR-WS.org, 2022.
  5. Finding colorful paths in temporal graphs. In Rosa María Benito, Chantal Cherifi, Hocine Cherifi, Esteban Moro, Luis M. Rocha, and Marta Sales-Pardo, editors, Complex Networks & Their Applications X - Volume 1, Proceedings of the Tenth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2021, Madrid, Spain, November 30 - December 2, 2021, volume 1015 of Studies in Computational Intelligence, pages 553–565. Springer, 2021. doi:10.1007/978-3-030-93409-5_46.
  6. On temporal graph exploration. J. Comput. Syst. Sci., 119:1–18, 2021. doi:10.1016/j.jcss.2021.01.005.
  7. Temporal graph classes: A view through temporal separators. Theor. Comput. Sci., 806:197–218, 2020. doi:10.1016/j.tcs.2019.03.031.
  8. Disentangling the computational complexity of network untangling. In Luc De Raedt, editor, Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022, pages 2037–2043. ijcai.org, 2022. doi:10.24963/ijcai.2022/283.
  9. The complexity of temporal vertex cover in small-degree graphs. In Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pages 10193–10201. AAAI Press, 2022.
  10. Petter Holme. Modern temporal network theory: a colloquium. The European Physical Journal B, 88(9):234, 2015.
  11. Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci., 64(4):820–842, 2002. doi:10.1006/jcss.2002.1829.
  12. Directed flow-augmentation. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 938–947, 2022.
  13. Directed flow-augmentation. In Stefano Leonardi and Anupam Gupta, editors, STOC ’22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pages 938–947. ACM, 2022. doi:10.1145/3519935.3520018.
  14. Flow-augmentation iii: Complexity dichotomy for boolean csps parameterized by the number of unsatisfied constraints. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 3218–3228. SIAM, 2023.
  15. Representative sets and irrelevant vertices: New tools for kernelization. J. ACM, 67(3):16:1–16:50, 2020. doi:10.1145/3390887.
  16. Königsberg sightseeing: Eulerian walks in temporal graphs. In Paola Flocchini and Lucia Moura, editors, Combinatorial Algorithms - 32nd International Workshop, IWOCA 2021, Ottawa, ON, Canada, July 5-7, 2021, Proceedings, volume 12757 of Lecture Notes in Computer Science, pages 485–500. Springer, 2021. doi:10.1007/978-3-030-79987-8_34.
  17. Almost 2-sat is fixed-parameter tractable. J. Comput. Syst. Sci., 75(8):435–450, 2009. doi:10.1016/j.jcss.2009.04.002.
  18. The network-untangling problem: from interactions to activity timelines. Data Min. Knowl. Discov., 35(1):213–247, 2021. doi:10.1007/s10618-020-00717-5.
  19. Path problems in temporal graphs. Proc. VLDB Endow., 7(9):721–732, 2014. doi:10.14778/2732939.2732945.
  20. Efficient algorithms for temporal path computation. IEEE Trans. Knowl. Data Eng., 28(11):2927–2942, 2016. doi:10.1109/TKDE.2016.2594065.
  21. The complexity of finding small separators in temporal graphs. J. Comput. Syst. Sci., 107:72–92, 2020. doi:10.1016/j.jcss.2019.07.006.

Summary

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

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