We provide two traversal algorithms. First, we demonstrate that there exists a local orientation for any anonymous graph G, provided that G is not a star graph, and G does not have any induced subgraph that is isomorphic to a path on four vertices. We show that it is possible to periodically traverse G with period at most 2n - 2; this matches the lower bound for the period for general graphs. Next, we provide a traversal for labelled graphs given that they satisfy two properties, which we define. The properties that we define and use are inspired by the properties of geometric planar graphs
Planar graphs have a rich history that dates back to the 18th Century. They form one of the core con...
\u3cp\u3eA temporal graph is a graph whose edge set can change over time. We only require that the e...
The problem of traversal of planar subdivisions or other graph-like structures without using mark bi...
AbstractWe consider the problem of periodic graph exploration in which a mobile entity with constant...
We consider periodic graph traversal in anonymous undirected graphs by a finite state Mealy automato...
AbstractWe consider the problem of periodic graph exploration by a finite automaton in which an auto...
International audienceWe consider the problem of periodic graph exploration by a finite automaton in...
We study the computability and complexity of the exploration problem in a class of highly dynamic gr...
We present a technique for representing bounded-degree planar graphs in a succinct fashion while per...
This paper includes a flexible algorithm for traversing a directed and an undirected graph. Graph tr...
International audienceWe consider the problem of periodic graph exploration in which a mobile entity...
A temporal graph is a graph whose edge set can change over time. We only require that the edge set i...
AbstractWe consider the problem of orienting the edges of a planar graph in such a way that the out-...
For a given graph (network) having costs [cij] associated with its links, the present paper examines...
We prove that it is a difficult task orienting the edges of a given undirected graph, so that, betwe...
Planar graphs have a rich history that dates back to the 18th Century. They form one of the core con...
\u3cp\u3eA temporal graph is a graph whose edge set can change over time. We only require that the e...
The problem of traversal of planar subdivisions or other graph-like structures without using mark bi...
AbstractWe consider the problem of periodic graph exploration in which a mobile entity with constant...
We consider periodic graph traversal in anonymous undirected graphs by a finite state Mealy automato...
AbstractWe consider the problem of periodic graph exploration by a finite automaton in which an auto...
International audienceWe consider the problem of periodic graph exploration by a finite automaton in...
We study the computability and complexity of the exploration problem in a class of highly dynamic gr...
We present a technique for representing bounded-degree planar graphs in a succinct fashion while per...
This paper includes a flexible algorithm for traversing a directed and an undirected graph. Graph tr...
International audienceWe consider the problem of periodic graph exploration in which a mobile entity...
A temporal graph is a graph whose edge set can change over time. We only require that the edge set i...
AbstractWe consider the problem of orienting the edges of a planar graph in such a way that the out-...
For a given graph (network) having costs [cij] associated with its links, the present paper examines...
We prove that it is a difficult task orienting the edges of a given undirected graph, so that, betwe...
Planar graphs have a rich history that dates back to the 18th Century. They form one of the core con...
\u3cp\u3eA temporal graph is a graph whose edge set can change over time. We only require that the e...
The problem of traversal of planar subdivisions or other graph-like structures without using mark bi...
Add to ORKG