Scholarlink

Abstract <p>The subject of the paper is an automaton that traverses connected plane simple undirected graphs in order to determine whether they are <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(r\)</EquationSource> <!--BMatMGU2570056Demidova-m3--> </InlineEquation>-almost-trees. The paper provides an algorithm and time estimates for establishing this property, as well as a description of the automaton under consideration.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Recognition of \(\boldsymbol{r}\)-Almost-Trees by Automata Traversing Graphs

  • 期刊论文

  • 发表日期：

    2025年10月1日

查看全文
  • A. A. Demidova

摘要

Abstract

The subject of the paper 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.