DMVP: Foremost Waypoint Coverage of Time-Varying Graphs

DOI10.1007/978-3-319-12340-0_3zbMath1417.68048arXiv1407.7279OpenAlexW1672217606MaRDI QIDQ2945178

Elliot Meyerson, Eric Aaron, Danny Krizanc

Publication date: 9 September 2015

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7279

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Agent technology and artificial intelligence (68T42)

Related Items (16)

An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ Deleting edges to restrict the size of an epidemic in temporal networks ⋮ How fast can we reach a target vertex in stochastic temporal graphs? ⋮ On short fastest paths in temporal graphs ⋮ Temporal Vertex Cover with a Sliding Time Window ⋮ Coloring temporal graphs ⋮ Computing parameters of sequence-based dynamic graphs ⋮ Temporal vertex cover with a sliding time window ⋮ Unnamed Item ⋮ Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring ⋮ Exploration of dynamic cactuses with sub-logarithmic overhead ⋮ Sliding window temporal graph coloring ⋮ The temporal explorer who returns to the base ⋮ How fast can we reach a target vertex in stochastic temporal graphs ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective^* ⋮ On the expressivity of time-varying graphs

This page was built for publication: DMVP: Foremost Waypoint Coverage of Time-Varying Graphs