Parameterised temporal exploration problems
From MaRDI portal
Publication:2698289
DOI10.1016/j.jcss.2023.01.003OpenAlexW4318269831MaRDI QIDQ2698289
Jakob T. Spooner, Erlebach, Thomas
Publication date: 21 April 2023
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.01594
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Traveling salesman problems in temporal graphs
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
- On exploring always-connected temporal graphs of small pathwidth
- Online and offline algorithms for the time-dependent TSP with time zones
- Finding temporal paths under waiting time constraints
- The complexity of finding small separators in temporal graphs
- Temporal vertex cover with a sliding time window
- Temporal flows in temporal networks
- On temporal graph exploration
- Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems
- A Remark on Stirling's Formula
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Color-coding
- Non-strict Temporal Exploration
- Parameterized Algorithms
- COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
- An Introduction to Temporal Graphs: An Algorithmic Perspective*
- Computing maximum matchings in temporal graphs.
- Connectivity and inference problems for temporal networks
- The temporal explorer who returns to the base
This page was built for publication: Parameterised temporal exploration problems