scientific article; zbMATH DE number 3911721

MaRDI QIDQ3687728zbMATH OpenFDO

Authors Charles Swart, Dana Richards

Publication date 1983

zbMATH Keywords

automata on graphsdeterministic machinesdirected graphGraph Identification Problemscratch tapeTraversal ProblemTuring acceptors

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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

Cited in

(10)

• The hierarchical structure of graph searches
• On the inference of strategies
• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths
• Universal traversal sequences for expander graphs
• Irredundant algorithms for traversing directed graphs: The deterministic case
• Bicycles and Spanning Trees
• Universal traversal sequences for paths and cycles
• scientific article; zbMATH DE number 1354852 (Why is no real title available?)
• TRAVERSING A GRAPH IN GENERAL POSITION
• Graph Traversals as Universal Constructions

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)