Universal sequences for complete graphs

DOI10.1016/0166-218X(90)90125-VzbMath0707.05032OpenAlexW2046427295MaRDI QIDQ918989

Noga Alon, Y. Ravid, Yossi Azar

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90125-v

zbMATH Keywords

complete digraphunique walk

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Universal traversal sequences with backtracking. ⋮ Memory Efficient Anonymous Graph Exploration ⋮ Length lower bounds for reflecting sequences and universal traversal sequences ⋮ IMPLEMENTATION OF GRAPH THEORY AND APPLICATION BY MAXIMA SOFTWARE ⋮ 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

Cites Work

• Unnamed Item
• Bounds on Universal Sequences
• Space Lower Bounds for Maze Threadability on Restricted Machines

This page was built for publication: Universal sequences for complete graphs