Document Open Access Logo

Algorithms and Complexity for Path Covers of Temporal DAGs

Authors Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud , Ralf Klasing

PDF
Thumbnail PDF

File

LIPIcs.MFCS.2024.38.pdf
  • Filesize: 0.82 MB
  • 17 pages

Document Identifiers

Author Details

Dibyayan Chakraborty
  • School of Computing, University of Leeds, UK
Antoine Dailly
  • Université Clermont-Auvergne, CNRS, Mines de Saint-Étienne, Clermont-Auvergne-INP, LIMOS, 63000 Clermont-Ferrand, France
Florent Foucaud
  • Université Clermont Auvergne, CNRS, Mines Saint-Étienne, Clermont Auvergne INP, LIMOS, 63000 Clermont-Ferrand, France
Ralf Klasing
  • Université de Bordeaux, Bordeaux INP, CNRS, LaBRI, UMR 5800, Talence, France

Funding

This research was partially supported by the ANR projects GRALMECO (ANR-21-CE48-0004) and TEMPOGRAL (ANR-22-CE48-0001) and by the International Research Center "Innovation Transportation and Production Systems" of the I-SITE CAP 20-25.

Cite AsGet BibTex

Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, and Ralf Klasing. Algorithms and Complexity for Path Covers of Temporal DAGs. In 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 306, pp. 38:1-38:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.MFCS.2024.38

Abstract

A path cover of a digraph is a collection of paths collectively containing its vertex set. A path cover with minimum cardinality for a directed acyclic graph can be found in polynomial time [Fulkerson, AMS'56; Cáceres et al., SODA'22]. Moreover, Dilworth’s celebrated theorem on chain coverings of partially ordered sets equivalently states that the minimum size of a path cover of a DAG is equal to the maximum size of a set of mutually unreachable vertices. In this paper, we examine how far these classic results can be extended to a dynamic setting. A temporal digraph has an arc set that changes over discrete time-steps; if the underlying digraph is acyclic, then it is a temporal DAG. A temporal path is a directed path in the underlying digraph, such that the time-steps of arcs are strictly increasing along the path. Two temporal paths are temporally disjoint if they do not occupy any vertex at the same time. A temporal path cover is a collection 𝒞 of temporal paths that covers all vertices, and 𝒞 is temporally disjoint if all its temporal paths are pairwise temporally disjoint. We study the computational complexities of the problems of finding a minimum-size temporal (disjoint) path cover (denoted as Temporal Path Cover and Temporally Disjoint Path Cover). On the negative side, we show that both Temporal Path Cover and Temporally Disjoint Path Cover are NP-hard even when the underlying DAG is planar, bipartite, subcubic, and there are only two arc-disjoint time-steps. Moreover, Temporally Disjoint Path Cover remains NP-hard even on temporal oriented trees. We also observe that natural temporal analogues of Dilworth’s theorem on these classes of temporal DAGs do not hold. In contrast, we show that Temporal Path Cover is polynomial-time solvable on temporal oriented trees by a reduction to Clique Cover for (static undirected) weakly chordal graphs (a subclass of perfect graphs for which Clique Cover admits an efficient algorithm). This highlights an interesting algorithmic difference between the two problems. Although it is NP-hard on temporal oriented trees, Temporally Disjoint Path Cover becomes polynomial-time solvable on temporal oriented lines and temporal rooted directed trees. Motivated by the hardness result on trees, we show that, in contrast, Temporal Path Cover admits an XP time algorithm with respect to parameter t_max + tw, where t_max is the maximum time-step and tw is the treewidth of the underlying static undirected graph; moreover, Temporally Disjoint Path Cover admits an FPT algorithm with respect to the same parameterization.

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
  • Theory of computation → Parameterized complexity and exact algorithms
Keywords
  • Temporal Graphs
  • Dilworth’s Theorem
  • DAGs
  • Path Cover
  • Temporally Disjoint Paths
  • Algorithms
  • Oriented Trees
  • Treewidth

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Eleni C. Akrida, George B. Mertzios, Sotiris E. Nikoletseas, Christoforos L. Raptopoulos, Paul G. Spirakis, and Viktor Zamaraev. How fast can we reach a target vertex in stochastic temporal graphs? J. Comput. Syst. Sci., 114:65-83, 2020. Google Scholar
  2. Eleni C. Akrida, George B. Mertzios, and Paul G. Spirakis. The temporal explorer who returns to the base. In Pinar Heggernes, editor, Algorithms and Complexity - 11th International Conference, CIAC 2019, Rome, Italy, May 27-29, 2019, Proceedings, volume 11485 of Lecture Notes in Computer Science, pages 13-24. Springer, 2019. Google Scholar
  3. Binh-Minh Bui-Xuan, Afonso Ferreira, and Aubin Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci., 14(2):267-285, 2003. Google Scholar
  4. Manuel Cáceres. Minimum chain cover in almost linear time. In Kousha Etessami, Uriel Feige, and Gabriele Puppis, editors, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, volume 261 of LIPIcs, pages 31:1-31:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. Google Scholar
  5. Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, and Alexandru I. Tomescu. Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time. In ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 359-376. SIAM, 2022. Google Scholar
  6. Manuel Cáceres, Brendan Mumey, Edin Husić, Romeo Rizzi, Massimo Cairo, Kristoffer Sahlin, and Alexandru I. Tomescu. Safety in multi-assembly via paths appearing in all path covers of a DAG. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 19(6):3673-3684, 2022. Google Scholar
  7. Arnaud Casteigts, Paola Flocchini, Walter Quattrociocchi, and Nicola Santoro. Time-varying graphs and dynamic networks. Int. J. Parallel Emergent Distributed Syst., 27(5):387-408, 2012. Google Scholar
  8. Arnaud Casteigts, Anne-Sophie Himmel, Hendrik Molter, and Philipp Zschoche. Finding temporal paths under waiting time constraints. Algorithmica, 83(9):2754-2802, 2021. Google Scholar
  9. Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, and Ralf Klasing. Algorithms and complexity for path covers of temporal DAGs. arXiv preprint arXiv:2403.04589, 2024. Google Scholar
  10. Yangjun Chen and Yibin Chen. On the graph decomposition. In 2014 IEEE Fourth International Conference on Big Data and Cloud Computing, pages 777-784, 2014. Google Scholar
  11. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms, Third Edition. The MIT Press, 3rd edition, 2009. Google Scholar
  12. Marek Cygan, Fedor V Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized algorithms, volume 4(8). Springer, 2015. Google Scholar
  13. Pradipta Kumar Das, Himansu Sekhar Behera, Prabir Kumar Jena, and Bijaya K. Panigrahi. An intelligent multi-robot path planning in a dynamic environment using improved gravitational search algorithm. Int. J. Autom. Comput., 18(6):1032-1044, 2021. Google Scholar
  14. Robert P. Dilworth. A decomposition theorem for partially ordered sets. Annals of Mathematics, 51:161-166, 1950. Google Scholar
  15. Jeff Erickson. Algorithms. self-published, 2019. URL: http://jeffe.cs.illinois.edu/teaching/algorithms/.
  16. D. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, 1962. Google Scholar
  17. Delbert R Fulkerson. Note on Dilworth’s decomposition theorem for partially ordered sets. In Proceedings of the American Mathematical Society, volume 7(4), pages 701-702, 1956. Google Scholar
  18. Martin Charles Golumbic. Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57). North-Holland Publishing Co., NLD, 2004. Google Scholar
  19. Ryan B. Hayward. Weakly triangulated graphs. J. Comb. Theory, Ser. B, 39(3):200-208, 1985. URL: https://doi.org/10.1016/0095-8956(85)90050-4.
  20. Ryan B. Hayward, Jeremy P. Spinrad, and R. Sritharan. Improved algorithms for weakly chordal graphs. ACM Trans. Algorithms, 3(2):14, 2007. URL: https://doi.org/10.1145/1240233.1240237.
  21. Petter Holme. Modern temporal network theory: a colloquium. European Physical Journal B, 88(9), 2015. Google Scholar
  22. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Transactions on Database Systems, 15(4):558-598, 1990. Google Scholar
  23. Naoyuki Kamiyama and Yasushi Kawase. On packing arborescences in temporal networks. Inf. Process. Lett., 115(2):321-325, 2015. Google Scholar
  24. David Kempe, Jon M. Kleinberg, and Amit Kumar. Connectivity and inference problems for temporal networks. J. Comput. Syst. Sci., 64(4):820-842, 2002. Google Scholar
  25. Nina Klobas, George B. Mertzios, Hendrik Molter, Rolf Niedermeier, and Philipp Zschoche. Interference-free walks in time: temporally disjoint paths. Autonomous Agents and Multi Agent Systems, 37(1):1, 2023. Google Scholar
  26. Nina Klobas, George B Mertzios, Hendrik Molter, Rolf Niedermeier, and Philipp Zschoche. Interference-free walks in time: Temporally disjoint paths. Autonomous Agents and Multi-Agent Systems, 37(1):1, 2023. Google Scholar
  27. T. Kloks. Treewidth, Computations and Approximations. Springer, 1994. Google Scholar
  28. Shimon Kogan and Merav Parter. Faster and unified algorithms for diameter reducing shortcuts and minimum chain covers. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 212-239. SIAM, 2023. Google Scholar
  29. Pascal Kunz, Hendrik Molter, and Meirav Zehavi. In which graph structures can we efficiently find temporally disjoint paths and walks? In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pages 180-188. ijcai.org, 2023. Google Scholar
  30. L. Lovász. Normal hypergraphs and the perfect graph conjecture. Discrete Mathematics, 2(3):253-267, 1972. Google Scholar
  31. Veli Mäkinen, Alexandru I. Tomescu, Anna Kuosmanen, Topi Paavilainen, Travis Gagie, and Rayan Chikhi. Sparse dynamic programming on dags with small width. ACM Trans. Algorithms, 15(2), February 2019. Google Scholar
  32. Loris Marchal, Hanna Nagy, Bertrand Simon, and Frédéric Vivien. Parallel scheduling of DAGs under memory constraints. In 2018 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2018, Vancouver, BC, Canada, May 21-25, 2018, pages 204-213. IEEE Computer Society, 2018. Google Scholar
  33. Andrea Marino and Ana Silva. Eulerian walks in temporal graphs. Algorithmica, 85(3):805-830, 2023. Google Scholar
  34. George B. Mertzios, Hendrik Molter, Malte Renken, Paul G. Spirakis, and Philipp Zschoche. The complexity of transitively orienting temporal graphs. In Filippo Bonchi and Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia, volume 202 of LIPIcs, pages 75:1-75:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Google Scholar
  35. Othon Michail. An introduction to temporal graphs: An algorithmic perspective. In Christos D. Zaroliagis, Grammati E. Pantziou, and Spyros C. Kontogiannis, editors, Algorithms, Probability, Networks, and Games - Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday, volume 9295 of Lecture Notes in Computer Science, pages 308-343. Springer, 2015. Google Scholar
  36. Simeon C. Ntafos and S. Louis Hakimi. On path cover problems in digraphs and applications to program testing. IEEE Transactions on Software Engineering, SE-5(5):520-529, 1979. Google Scholar
  37. Jari Saramäki and Petter Holme, editors. Temporal Network Theory. Computational Social Sciences. Springer, Germany, October 2019. Google Scholar
  38. Jeremy P. Spinrad and R. Sritharan. Algorithms for weakly triangulated graphs. Discret. Appl. Math., 59(2):181-191, 1995. URL: https://doi.org/10.1016/0166-218X(93)E0161-Q.
  39. Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, and Eli Boyarski. Multi-agent pathfinding: Definitions, variants, and benchmarks. In Pavel Surynek and William Yeoh, editors, Proceedings of the Twelfth International Symposium on Combinatorial Search, SOCS 2019, Napa, California, 16-17 July 2019, pages 151-159. AAAI Press, 2019. Google Scholar
  40. Dawei Sun, Jingkai Chen, Sayan Mitra, and Chuchu Fan. Multi-agent motion planning from signal temporal logic specifications. IEEE Robotics Autom. Lett., 7(2):3451-3458, 2022. Google Scholar
  41. Huanhuan Wu, James Cheng, Yiping Ke, Silu Huang, Yuzhen Huang, and Hejun Wu. Efficient algorithms for temporal path computation. IEEE Transactions on Knowledge and Data Engineering, 28(11):2927-2942, 2016. Google Scholar
  42. Haifeng Xu, Fei Fang, Albert Xin Jiang, Vincent Conitzer, Shaddin Dughmi, and Milind Tambe. Solving zero-sum security games in discretized spatio-temporal domains. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AAAI'14, pages 1500-1506. AAAI Press, 2014. Google Scholar
  43. Yue Yin and Bo An. Efficient resource allocation for protecting coral reef ecosystems. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI'16, pages 531-537. AAAI Press, 2016. Google Scholar
  44. Youzhi Zhang, Bo An, Long Tran-Thanh, Zhen Wang, Jiarui Gan, and Nicholas R. Jennings. Optimal escape interdiction on transportation networks. In Carles Sierra, editor, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pages 3936-3944. ijcai.org, 2017. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact