The one-visibility localization game

We introduce a variant of the Localization game in which the cops only have visibility one, along with the corresponding optimization parameter, the one-visibility localization number ζ1. By developing lower bounds using isoperimetric inequalities, we give upper and lower bounds for ζ1 on k-ary tree...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 978; p. 114186
Main Authors:	Bonato, Anthony, Marbach, Trent G., Molnar, Michael, Nir, JD
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 02-11-2023
Subjects:	Graphs Isoperimetric inequalities Limited visibility Localization number Pursuit-evasion games Graphs Pursuit-evasion games Localization number Isoperimetric inequalities Limited visibility
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!