By Topic

Constructing generalized universal traversing sequences of polynomial size for graphs with small diameter

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
S. Istrail ; Dept. of Math., Wesleyan Univ., Middletown, CT, USA

A generalized version of universal traversing sequences is constructed. The generalization preserves the features of the universal traversing sequences that make them attractive for applications to derandomizations and space-bounded computation. For every n, there is constructed a sequence that is used by a finite automaton with O(1) states in order to traverse all the n-vertex labeled undirected graphs. The automaton walks on the graph; when it is at a certain vertex, it uses the edge labels and the sequence in order to decide which edge to follow. When it is walking on an edge, the automaton can see the edge labeling. As a corollary, polynomial-size generalized universal traversing sequences constructible in DSpace(log n) are obtained for certain classes of graphs

Published in:

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Date of Conference:

22-24 Oct 1990