A note on watchman's walks in de Bruijn graphs

A note on watchman's walks in de Bruijn graphs

The watchman's walk problem in a digraph calls for finding a minimum length closed dominating walk, where direction of arcs is respected. The watchman's walk of a de Bruijn graph of order $k$ is described by a de Bruijn sequence of order $k-1$. This idea is extended to certain subdigraphs...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Dyer, Danny, Howell, Jared, Pittman, Brittany
Format: Artikel
Sprache:eng
Schlagworte:
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The watchman's walk problem in a digraph calls for finding a minimum length closed dominating walk, where direction of arcs is respected. The watchman's walk of a de Bruijn graph of order $k$ is described by a de Bruijn sequence of order $k-1$. This idea is extended to certain subdigraphs of de Bruijn graphs.
DOI:10.48550/arxiv.2007.12825