Universal traversal sequences for paths and cycles
From MaRDI portal
Publication:3782809
DOI10.1016/0196-6774(87)90019-8zbMath0641.68103OpenAlexW2045648565MaRDI QIDQ3782809
Publication date: 1987
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(87)90019-8
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (9)
Universal traversal sequences with backtracking. ⋮ Memory Efficient Anonymous Graph Exploration ⋮ Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques ⋮ Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)). ⋮ The Evolution of the Cover Time ⋮ Impact of memory size on graph exploration capability ⋮ Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space ⋮ Lower bounds on the length of universal traversal sequences ⋮ Graph exploration by a finite automaton
This page was built for publication: Universal traversal sequences for paths and cycles