Cop and Robber Game and Hyperbolicity
From MaRDI portal
Publication:5246100
DOI10.1137/130941328zbMath1309.05126arXiv1308.3987OpenAlexW2055592581MaRDI QIDQ5246100
Jérémie Chalopin, Panos Papasoglu, Victor Chepoi, Timothée Pecatte
Publication date: 17 April 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3987
approximation algorithmsGromov hyperbolicitycop and robber gamesdismantling orderingsweakly modular graphs
Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Obstructions to a small hyperbolicity in Helly graphs ⋮ Fast approximation and exact computation of negative curvature parameters of graphs ⋮ The diameter of AT‐free graphs ⋮ Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant ⋮ On the hyperbolicity constant of circular-arc graphs ⋮ Coarse geometry of the cops and robber game ⋮ A simple approach for lower-bounding the distortion in any hyperbolic embedding ⋮ Weakly Modular Graphs and Nonpositive Curvature ⋮ Control Sequencing in a Game of Identity Pursuit-Evasion ⋮ Fellow travelers phenomenon present in real-world networks ⋮ Mathematical properties on the hyperbolicity of interval graphs
