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 subdigra...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2020-07
Hauptverfasser: Dyer, Danny, Howell, Jared, Pittman, Brittany
Format: Artikel
Sprache:eng
Schlagworte:
Graph theory
Graphs
Online-Zugang:Volltext
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.
ISSN:2331-8422