Connected Search for a Lazy Robber

DOI10.4230/LIPICS.FSTTCS.2019.7MaRDI QIDQ5875639zbMATH OpenOpenAlexFDO

Authors Isolde Adler, Christophe Paul, Dimitrios M. Thilikos

Publication date 3 February 2023

Full work available at URL https://hal.archives-ouvertes.fr/hal-03003243

zbMATH Keywords

graph searchingobstructionstree-decomposition

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Recommendations

• Connected search for a lazy robber
• Searching for a Visible, Lazy Fugitive
• Searching for a Visible, Lazy Fugitive
• Lazy cops and robbers on hypercubes
• Locating a robber with multiple probes
• Locating a robber on a graph
• Pursuing a fast robber on a graph
• Lazy Cops and Robbers on generalized hypercubes
• Catching a fast robber on the grid
• A faster algorithm for cops and robbers

Cited in

(5)

• Searching for a Visible, Lazy Fugitive
• Searching for a Visible, Lazy Fugitive
• scientific article; zbMATH DE number 7651203 (Why is no real title available?)
• Connected search for a lazy robber
• A polynomial time algorithm to compute the connected treewidth of a series-parallel graph

This page was built for publication: Connected Search for a Lazy Robber

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875639)