The shortest temporal exploration problem

DOI10.1016/J.TCS.2026.116190MaRDI QIDQ7347273zbMATH OpenFDO

Authors Stefan Balev, Eric Sanlaville, Antoine Toullalan

Publication date 14 September 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.116190

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A study of connectivity on dynamic graphs: computing persistent connected components
• An introduction to temporal graphs: an algorithmic perspective
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Connectivity and inference problems for temporal networks
• Exploiting automorphisms of temporal graphs for fast exploration and rendezvous
• Exploration of k-edge-deficient temporal graphs
• Exploration of constantly connected dynamic graphs based on cactuses
• Exploration of periodically varying graphs
• Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
• Title not available (Why is no real title available?)
• Information spreading in dynamic networks: an analytical approach
• Kernelizing temporal exploration problems
• Label-connected graphs and the gossip problem
• On temporal graph exploration
• On the size and the approximability of minimum temporally connected subgraphs
• Temporal cliques admit sparse spanners
• Temporal network optimization subject to connectivity constraints
• Temporally connected components
• The complexity of computing optimum labelings for temporal connectivity
• Traveling salesman problems in temporal graphs
• Two moves per time step make a difference

This page was built for publication: The shortest temporal exploration problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7347273)