Algorithms and complexity for path covers of temporal DAGs

Chakraborty, D. orcid.org/0000-0003-0534-6417, Dailly, A., Foucaud, F. et al. (1 more author) (2024) Algorithms and complexity for path covers of temporal DAGs. In: 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). 49th International Symposium on Mathematical Foundations of Computer Science, 26-30 Aug 2024, Bratislava, Slovakia. Leibniz International Proceedings in Informatics (LIPIcs), 306 . Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , Wadern, Germany , 38:1-38:17. ISBN 978-3-95977-335-5

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© Dibyayan Chakraborty, Antoine Dailly, Florent Foucaud, and Ralf Klasing; licensed under Creative Commons License CC-BY 4.0 .

Keywords: Temporal Graphs, Dilworth’s Theorem, DAGs, Path Cover, Temporally Disjoint Paths, Algorithms, Oriented Trees, Treewidth
Dates:
  • Published: 23 August 2024
  • Published (online): 23 August 2024
  • Accepted: 24 June 2024
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity
Depositing User: Symplectic Publications
Date Deposited: 22 Jul 2024 10:21
Last Modified: 30 Sep 2024 09:57
Published Version: https://drops.dagstuhl.de/entities/document/10.423...
Status: Published
Publisher: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
Series Name: Leibniz International Proceedings in Informatics (LIPIcs)
Identification Number: 10.4230/LIPIcs.MFCS.2024.38
Open Archives Initiative ID (OAI ID):

Export

Statistics