Traversal with Enumeration of Geometric Graphs in Bounded Space

Sahand Khakabimamaghani, Masood Masjoody, Ladislav Stacho

In this paper, we provide an algorithm for traversing geometric graphs which visits all vertices, and reports every vertex and edge exactly once. To achieve this, we combine a give…