Universal sequences for complete graphs

DOI10.1016/0166-218X(90)90125-VMaRDI QIDQ918989zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Bounds on Universal Sequences
• Lower bounds on the length of universal traversal sequences
• Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs
• scientific article; zbMATH DE number 15261
• Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques

Cites work

• Bounds on Universal Sequences
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• Space Lower Bounds for Maze Threadability on Restricted Machines

Cited in

(13)

• Lower bounds on the length of universal traversal sequences
• Universal traversal sequences for expander graphs
• Universal traversal sequences with backtracking.
• Length lower bounds for reflecting sequences and universal traversal sequences
• Graph exploration by a finite automaton
• Uniform length dominating sequence graphs
• Bounds on Universal Sequences
• scientific article; zbMATH DE number 22956 (Why is no real title available?)
• Memory Efficient Anonymous Graph Exploration
• IMPLEMENTATION OF GRAPH THEORY AND APPLICATION BY MAXIMA SOFTWARE
• Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space
• Universal sequences of spatial graphs
• Impact of memory size on graph exploration capability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918989)