The following pages link to Bounds on Universal Sequences (Q3472132):
Displaying 13 items.
- Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) (← links)
- Universal sequences for complete graphs (Q918989) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques (Q1117703) (← links)
- Lower bounds on the length of universal traversal sequences (Q1201151) (← links)
- Universal sequences (Q1360981) (← links)
- Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)). (Q1401264) (← links)
- Identical approximative sequence for various notions of universality (Q1763775) (← links)
- A note on self-similarity in the universal sequence (Q1809578) (← links)
- Universal traversal sequences with backtracking. (Q1872734) (← links)
- Length lower bounds for reflecting sequences and universal traversal sequences (Q2407040) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
