Temporal Network Optimization Subject to Connectivity Constraints
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12127
- Type
- D - Journal article
- DOI
-
10.1007/s00453-018-0478-6
- Title of journal
- Algorithmica: an international journal in computer science
- Article number
- -
- First page
- 1416
- Volume
- 81
- Issue
- 4
- ISSN
- 0178-4617
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2018
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Citation count
- 2
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper appeared at ICALP'13. It initiated the algorithmic study of multi-labelled temporal graphs, which was presented to the wider research community in "Elements of the theory of dynamic networks" by Michail and Spirakis (Comm.ACM'18). Follow up work that uses the model or results include "On the size and approximability of minimal temporally connected subgraphs" (ICALP'16) and "Assigning times to minimise reachability in temporal graphs" (JCSS'21).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -