Universal traversal sequences with backtracking.
type: Item
instance of: scholarly article
title: Universal traversal sequences with backtracking.
zbMATH Open document ID: 1059.68080
DOI: 10.1016/S0022-0000(02)00023-5
author: Michal Koucký
published in: Journal of Computer and System Sciences
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1910858
zbMATH Keywords: exploration sequences
MaRDI profile type: Publication
cites work: Universal sequences for complete graphs
cites work: Bounds on Universal Sequences
cites work: Lower bounds on the length of universal traversal sequences
cites work: Universal traversal sequences for paths and cycles
cites work: Lower bounds on universal traversal sequences based on chains of length five
cites work: The electrical resistance of a graph captures its commute and cover times
cites work: Q4551362
cites work: Universal traversal sequences for expander graphs
cites work: Pseudorandomness for network algorithms
cites work: Q4098444
cites work: On the cover time of random walks on graphs
cites work: Universal traversal sequences of length \(n^{0(\log \,n)}\) for cliques
cites work: Pseudorandom generators for space-bounded computation
cites work: Q4230323
cites work: Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree Graphs
full work available at URL: s0022-0000(02)00023-5
OpenAlex ID: W2148369462
description: scientific article; zbMATH DE number 1910858