Exploration of Periodically Varying Graphs

DOI10.1007/978-3-642-10631-6_55zbMath1272.05196OpenAlexW1532359370MaRDI QIDQ3652241

Bernard Mans, Paola Flocchini, Nicola Santoro

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_55

zbMATH Keywords

complexitycomputabilityexploration problempublic transportclass of highly dynamic graphshighly dynamic infrastructureless networkslow earth orbiting satellite systemssecurity guards tours

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ On temporal graph exploration ⋮ Deleting edges to restrict the size of an epidemic in temporal networks ⋮ Efficient routing in carrier-based mobile networks ⋮ Temporal Vertex Cover with a Sliding Time Window ⋮ Coloring temporal graphs ⋮ Searching for black holes in subways ⋮ Temporal vertex cover with a sliding time window ⋮ Unnamed Item ⋮ Sliding window temporal graph coloring ⋮ Self-stabilizing robots in highly dynamic environments ⋮ The temporal explorer who returns to the base

This page was built for publication: Exploration of Periodically Varying Graphs