scientific article; zbMATH DE number 7724250

DOI10.4230/lipics.mfcs.2021.77arXiv2104.08616MaRDI QIDQ6113365

Nils Morawietz, Petra Wolf

Publication date: 8 August 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitygame of cops and robbersedge periodic cycletime variable graph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Simple, strict, proper, happy: a study of reachability in temporal graphs ⋮ Cops \& robber on periodic temporal graphs: characterization and improved bounds ⋮ Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs

This page was built for publication: