Universal traversal sequences for expander graphs
From MaRDI portal
Recommendations
- Publication:3687728
- Universal traversal sequences for paths and cycles
- Universal Traversal Sequences
- Universal sequences for complete graphs
- Graph Traversals as Universal Constructions
- Publication:4228225
- Universal sequences of spatial graphs
- Lower bounds on the length of universal traversal sequences
- Universal traversal sequences with backtracking.
- Expander graphs and their applications
Cites work
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Explicit constructions of linear-sized superconcentrators
- Relationships between nondeterministic and deterministic tape complexities
- Two Applications of Inductive Counting for Complementation Problems
- Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques
Cited in
(12)- Log-space constructible universal traversal sequences for cycles of length O(\(n^{4.03}\)).
- Impact of memory size on graph exploration capability
- Memory Efficient Anonymous Graph Exploration
- Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space
- Graph exploration by a finite automaton
- Universal sequences of spatial graphs
- Universal traversal sequences for paths and cycles
- Universal traversal sequences with backtracking.
- scientific article; zbMATH DE number 3911721 (Why is no real title available?)
- scientific article; zbMATH DE number 1796948 (Why is no real title available?)
- Graph Traversals as Universal Constructions
- Expanders Are Universal for the Class of All Spanning Trees
This page was built for publication: Universal traversal sequences for expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802060)
