Eavesdropping games

DOI10.1145/333979.333980zbMath1133.68469OpenAlexW2012713361MaRDI QIDQ5385336

Matthew Franklin, Zvi Galil, Mordechai M. Yung

Publication date: 5 May 2008

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/333979.333980

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (18)

Complexity and monotonicity results for domination games ⋮ Bounding the search number of graph products ⋮ Strong-mixed searching and pathwidth ⋮ Distributed protocols against mobile eavesdroppers ⋮ Fast searching games on graphs ⋮ Mixed Search Number of Permutation Graphs ⋮ Monotonicity of strong searching on digraphs ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ A network game with attackers and a defender ⋮ An annotated bibliography on guaranteed graph searching ⋮ Connected graph searching ⋮ Fugitive-search games on graphs and related parameters ⋮ Communication-Optimal Proactive Secret Sharing for Dynamic Groups ⋮ BOUNDARY-OPTIMAL TRIANGULATION FLOODING ⋮ On the domination search number ⋮ Connected subgraph defense games ⋮ Sweeping graphs with large clique number ⋮ Searching expenditure and interval graphs

This page was built for publication: Eavesdropping games