2014
DOI: 10.15514/ispras-2014-26(6)-4
|View full text |Cite
|
Sign up to set email alerts
|

Building direct and back spanning trees by automata on a graph

Abstract: The paper presents a parallel graph exploration algorithm. Automaton on a graph is an analogue of the Turing machine-tape cells correspond to graph vertices, where the automaton can store some data, and moves along the tape correspond to moves along graph arcs. This system can be considered also as an aggregate of finite automatons located in graph vertices and interacting by message sending. Each automaton changes its state according to the data stored in the corresponding vertex, and moves along graph arcs a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 3 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?