Edge exploration of temporal graphs
From MaRDI portal
Publication:5925630
DOI10.1007/s00453-022-01018-7OpenAlexW3135496652MaRDI QIDQ5925630
Benjamin Merlin Bumpus, Kitty Meeks
Publication date: 9 March 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01018-7
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Traveling salesman problems in temporal graphs
- Temporal network optimization subject to connectivity constraints
- Finding temporal paths under waiting time constraints
- Königsberg sightseeing: Eulerian walks in temporal graphs
- How fast can we reach a target vertex in stochastic temporal graphs?
- The complexity of optimal design of temporally connected graphs
- On temporal graph exploration
- Deleting edges to restrict the size of an epidemic in temporal networks
- On the Size and the Approximability of Minimum Temporally Connected Subgraphs
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- 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
- Edge exploration of temporal graphs
This page was built for publication: Edge exploration of temporal graphs
