Nina Klobas nina.klobas@durham.ac.uk
PGR Student Doctor of Philosophy
The complexity of computing optimum labelings for temporal connectivity
Klobas, Nina; Mertzios, George; Molter, Hendrik; Spirakis, Paul
Authors
Dr George Mertzios george.mertzios@durham.ac.uk
Associate Professor
Hendrik Molter
Paul Spirakis
Journal Article Type | Article |
---|---|
Acceptance Date | Jul 2, 2024 |
Online Publication Date | Jul 9, 2024 |
Deposit Date | Jul 20, 2024 |
Publicly Available Date | Jul 22, 2024 |
Journal | Journal of Computer and System Sciences |
Print ISSN | 0022-0000 |
Electronic ISSN | 1090-2724 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Article Number | 103564 |
DOI | https://doi.org/10.1016/j.jcss.2024.103564 |
Public URL | https://durham-repository.worktribe.com/output/2606625 |
Files
Accepted Journal Article (Advance Online Version)
(4.5 Mb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
You might also like
The complexity of computing optimum labelings for temporal connectivity
(2022)
Presentation / Conference Contribution
The complexity of temporal vertex cover in small-degree graphs
(2022)
Presentation / Conference Contribution
Interference-free walks in time: temporally disjoint paths
(2021)
Presentation / Conference Contribution
Interference-free walks in time: Temporally disjoint paths
(2022)
Journal Article
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs
(2023)
Presentation / Conference Contribution
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search