Pages that link to "Item:Q2945178"
From MaRDI portal
The following pages link to DMVP: Foremost Waypoint Coverage of Time-Varying Graphs (Q2945178):
Displaying 16 items.
- Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring (Q722206) (← links)
- Computing parameters of sequence-based dynamic graphs (Q1999994) (← links)
- Temporal vertex cover with a sliding time window (Q2009637) (← links)
- Exploration of dynamic cactuses with sub-logarithmic overhead (Q2035475) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs? (Q2194859) (← links)
- On short fastest paths in temporal graphs (Q2232230) (← links)
- Coloring temporal graphs (Q2237899) (← links)
- On the expressivity of time-varying graphs (Q2348032) (← links)
- Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
- Temporal Vertex Cover with a Sliding Time Window (Q5002837) (← links)
- How fast can we reach a target vertex in stochastic temporal graphs (Q5092333) (← links)
- (Q5092419) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- The temporal explorer who returns to the base (Q5918316) (← links)