Lower bounds on universal traversal sequences based on chains of length five

DOI10.1006/inco.1995.1117zbMath0835.68053OpenAlexW2010371907MaRDI QIDQ1898471

Martin Tompa, Jonathan F. Buss

Publication date: 17 September 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2b7883904204d58652ca6a40c7b5554c17d40e22

zbMATH Keywords

universal traversal sequences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Universal traversal sequences with backtracking. ⋮ Memory Efficient Anonymous Graph Exploration ⋮ Length lower bounds for reflecting sequences and universal traversal sequences ⋮ Impact of memory size on graph exploration capability ⋮ Graph exploration by a finite automaton

This page was built for publication: Lower bounds on universal traversal sequences based on chains of length five