Exploration of periodically varying graphs

DOI10.1007/978-3-642-10631-6_55MaRDI QIDQ3652241zbMATH OpenOpenAlexFDO

Authors Bernard Mans, P. Flocchini, N. 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

class of highly dynamic graphscomplexitycomputabilityexploration problemhighly dynamic infrastructureless networkslow earth orbiting satellite systemspublic transportsecurity guards tours

Mathematics Subject Classification ID

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

Recommendations

• On the exploration of time-varying networks
• Exploration of carrier-based time-varying networks: the power of waiting
• More efficient periodic traversal in anonymous undirected graphs
• Fast periodic graph exploration with constant memory
• More efficient periodic traversal in anonymous undirected graphs

Cited in

(17)

• Temporal vertex cover with a sliding time window
• Sliding window temporal graph coloring
• Coloring temporal graphs
• Deleting edges to restrict the size of an epidemic in temporal networks
• An introduction to temporal graphs: an algorithmic perspective
• Estimation of number of modes in periodic graphs
• Efficient routing in carrier-based mobile networks
• Temporal vertex cover with a sliding time window
• Deleting edges to restrict the size of an epidemic in temporal networks
• The temporal explorer who returns to the base
• Parity games on temporal graphs
• Making the interval membership width of temporal graphs connected and bidirectional
• Searching for black holes in subways
• Temporal separators with deadlines
• Making the interval membership width of temporal graphs connected and bidirectional
• Temporal explorability games
• The shortest temporal exploration problem

This page was built for publication: Exploration of periodically varying graphs

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