Abstract. The polynomial algorithm for constructing a special Eulerian cycle in a plane connected 4-regular graph G = (V,E) is presented in the paper. First.
The polynomial algorithm for constructing a special Eulerian cycle in a plane connected 4-regular graph G = (V,E) is presented in the paper.
The paper is devoted to a polynomial-time algorithm for constructing a non-intersecting ordered enclosing chain (NOE-chain) for a plane Eulerian graph.
It is shown that the algorithm constructs a route with the indicated properties in linear time for a plane connected 4-regular graph. The software ...
Algorithm AOE-TRAIL allow to construct AOE-chain for a plane connected 4-regular graph G by time O(|E(G)| · log2|V (G)|). 3.2 Class of NOE-chains and Algorithm ...
AOE-Trails Constructing for a Plane Connected 4-Regular Graph. Proceedings ... Algorithm for constructing AOE circuit in a connected flat 4-regular graph.
Let us consider the Algorithm 7 for constructing the A O E -chain for plane connected 4-regular graph [32,33]. Algorithm 6 CUT-POINT-SPLITTING. Require: plane ...
Dec 3, 2016 · Even if we fix the number of vertices, the (connected) 4-regular planar graph of that order (number of vertices) may not be unique.
Missing: AOE- | Show results with:AOE-
If a connected 4-regular plane graph contains one of the configurations of the types of Figure 2, it can be reduced to a connected 4-regular plane graph of ...
AOE-trails constructing for a plane connected 4-regular graph. CEUR Workshop Proceedings, 1623, 821-826. URL http://ceur-ws.org/Vol-1623/paperco11.pdf ...