Visibility graphs, dismantlability, and the cops and robbers game

DOI10.1016/j.comgeo.2017.07.001zbMath1407.91057arXiv1601.01298OpenAlexW2962749834MaRDI QIDQ1693315

Anna Lubiw, Hamideh Vosoughpour, Jack Scott Snoeyink

Publication date: 12 February 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.01298

zbMATH Keywords

pursuit evasiondismantlabilityvisibility graphscops and robbers gamesplinegons

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ Safe navigation in adversarial environments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of pursuit on a graph
• A game of cops and robbers
• Computational geometry in a curved world
• An annotated bibliography on guaranteed graph searching
• The capture time of a graph
• Graph searching and a min-max theorem for tree-width
• Vertex-to-vertex pursuit in a graph
• Meyniel's conjecture on the cop number: a survey
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Computing Shortest Paths amid Convex Pseudodisks
• Cops and Robbers on Geometric Graphs
• Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions
• A near-optimal algorithm for shortest paths among curved obstacles in the plane
• Computing shortest paths among curved obstacles in the plane
• Unsolved problems in visibility graphs of points, segments, and polygons
• Visibility Algorithms in the Plane

This page was built for publication: Visibility graphs, dismantlability, and the cops and robbers game