Abstract:
The subject of the paper work is an automaton that traverses connected plane simple undirected graphs in order to determine whether they are $r$-almost-trees. The paper provides an algorithm and time estimates for establishing this property, as well as a description of the automaton under consideration.
Key words:automata, graphs, cyclomatic number of a graph, $r$-almost-trees.
Fulltext:
PDF file (285 kB)