Cops \& robber on periodic temporal graphs: characterization and improved bounds

DOI10.1007/978-3-031-32733-9_17OpenAlexW4377971988MaRDI QIDQ6148075

Jean-Lou De Carufel, Frédéric Simard, Paola Flocchini, Nicola Santoro

Publication date: 11 January 2024

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-32733-9_17

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A game of cops and robbers
• Dynamic graph models
• Multiaspect graphs: algebraic representation and algorithms
• Vertex-to-vertex pursuit in a graph
• On the exploration of time-varying networks
• A faster algorithm for cops and robbers
• Distributed exploration of dynamic rings
• Exploration of dynamic tori by multiple agents
• Exploration of dynamic networks: tight bounds on the number of agents
• On temporal graph exploration
• Distributed computation in dynamic networks
• A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
• Cops and Robbers on Planar‐Directed Graphs
• Characterizations and algorithms for generalized Cops and Robbers games
• Cops and Robbers on Dynamic Graphs: Offline and Online Case
• Fully Active Cops and Robbers
• Measuring Temporal Lags in Delay-Tolerant Networks
• Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
• Gathering in dynamic rings

This page was built for publication: Cops \& robber on periodic temporal graphs: characterization and improved bounds