The watchman's walk problem on directed graphs

zbMath1468.05094arXiv2007.13901MaRDI QIDQ5000299

Danny Dyer, Jared Howell, Brittany Pittman

Publication date: 12 July 2021

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

zbMATH Keywords

watchman's walk problemminimum closed dominating walk

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random walks on graphs (05C81)

Related Items (1)

The watchman's walk problem on directed graphs

Cites Work

• A characterization of unique tournaments
• Bounds on watching and watching graph products
• Fast parallel algorithms for finding hamiltonian paths and cycles in a tournament
• The watchman's walk problem on directed graphs
• On a Problem in Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The watchman's walk problem on directed graphs