The Complexity of Computing Optimum Labelings for Temporal Connectivity (2022)
Attributed to:
Algorithmic Aspects of Temporal Graphs
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.4230/lipics.mfcs.2022.62
Publication URI: https://api.elsevier.com/content/abstract/scopus_id/85137613097
Type: Other
Volume: 241
Parent Publication: Leibniz International Proceedings in Informatics, LIPIcs
ISSN: 18688969