Two moves per time step make a difference
From MaRDI portal
Recommendations
Cites work
- An introduction to temporal graphs: an algorithmic perspective
- Exploration of constantly connected dynamic graphs based on cactuses
- Exploration of the T-interval-connected dynamic graphs: the case of the ring
- Faster exploration of degree-bounded temporal graphs
- Online and offline algorithms for the time-dependent TSP with time zones
- Temporal vertex cover with a sliding time window
- The Planar Hamiltonian Circuit Problem is NP-Complete
- The complexity of finding small separators in temporal graphs
- The complexity of optimal design of temporally connected graphs
- Traveling salesman problems in temporal graphs
Cited in
(15)- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
- Temporal reachability minimization: delaying vs. deleting
- Collision-free robot scheduling
- Exploration of \(k\)-edge-deficient temporal graphs
- Cluster editing for multi-layer and temporal graphs
- Exploration of k-edge-deficient temporal graphs
- Exploration of dynamic networks: tight bounds on the number of agents
- Multistage \(s-t\) path: confronting similarity with dissimilarity
- Exploiting automorphisms of temporal graphs for fast exploration and rendezvous
- Non-strict Temporal Exploration
- Temporal queries for dynamic temporal forests
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- Parameterised temporal exploration problems
- Kernelizing temporal exploration problems
- Counting temporal paths
This page was built for publication: Two moves per time step make a difference
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092344)
