scientific article; zbMATH DE number 3911721

zbMATH Open0571.68046MaRDI QIDQ3687728FDOQ3687728

Authors: Charles Swart, Dana Richards 

Publication date: 1983

Title of this publication is not available (Why is that?)

Recommendations

• Universal traversal sequences for paths and cycles
• Universal Traversal Sequences
• Universal traversal sequences with backtracking.
• Time-space tradeoffs for undirected graph traversal by graph automata
• Universal traversal sequences for expander graphs

zbMATH Keywords

directed graphTuring acceptorsdeterministic machinesautomata on graphsGraph Identification Problemscratch tapeTraversal Problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• The hierarchical structure of graph searches
• Universal traversal sequences for expander graphs
• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• Graph Traversals as Universal Constructions
• On the inference of strategies
• Universal traversal sequences for paths and cycles
• TRAVERSING A GRAPH IN GENERAL POSITION
• Bicycles and Spanning Trees
• Irredundant algorithms for traversing directed graphs: The deterministic case

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3687728)