Pages that link to "Item:Q1201151"
From MaRDI portal
The following pages link to Lower bounds on the length of universal traversal sequences (Q1201151):
Displaying 15 items.
- Lower bounds on lengths of checking sequences (Q613138) (← links)
- Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) (← links)
- Universal sequences for complete graphs (Q918989) (← links)
- Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques (Q1117703) (← links)
- On the mean and variance of cover times for random walks on graphs (Q1353782) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- Universal traversal sequences for expander graphs (Q1802060) (← links)
- Universal traversal sequences with backtracking. (Q1872734) (← links)
- Lower bounds on universal traversal sequences based on chains of length five (Q1898471) (← links)
- Length lower bounds for reflecting sequences and universal traversal sequences (Q2407040) (← links)
- Universal traversal sequences for paths and cycles (Q3782809) (← links)
- Universal sequences and graph cover times: A short survey (Q3977586) (← links)
- Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs (Q4027857) (← links)
- Lower bounds for the length of test sequences using UIOs (Q4698227) (← links)
- Edge exploration of anonymous graph by mobile agent with external help (Q6488105) (← links)