On the Cutting Edge: Simplified O(n) Planarity by Edge Addition

Abstract

We present new O(n)-time methods for planar embedding and Kuratowski subgraph isolation that were inspired by the Booth-Lueker PQ-tree implementation of the Lempel-Even-Cederbaum vertex addition method. In this paper, we improve upon our conference proceedings formulation and upon the Shih-Hsu PC-tree, both of which perform comprehensive tests of planarity conditions embedding the edges from a vertex to its descendants in a 'batch' vertex addition operation. These tests are simpler than but analogous to the templating scheme of the PQ-tree. Instead, we take the edge to be the fundamental unit of addition to the partial embedding while preserving planarity. This eliminates the batch planarity condition testing in favor of a few localized decisions of a path traversal process, and it exploits the fact that subgraphs can become biconnected by adding a single edge. Our method is presented using only graph constructs, but our definition of external activity, path traversal process and theoretical analysis of correctness can be applied to optimize the PC-tree as well.

Acyclic 3-coloring of generalized Petersen graphs

“…The three triconnected cubic planar graphs with no acyclic 3-coloring Boyer and Myrvold (2004); finally, from these planar cubic graphs, we obtain the triconnected and acyclically 3-colorable ones by executing a program which is designed based on the idea of enumeration. In this paper, we extend the problem to the following conjecture.…”

Topological characteristics of logic networks generated by a graph-based methodology

“…One of these methodologies is the Boyer-Myrvold algorithm [6], a state-ofart way to verify planarity through the edge addition technique.…”

“…There are two possible situations: (1) PD and PU are both planar or (2) at least one of them is non-planar. Line 4 performs a planarity check for each plan through a Boyer-Myrvold method [6]. In case of a planar arrangement, the code snippet in lines 5-10 is executed.…”

On protein structure alignment under distance constraint

“…First, a planar graph representation G of the 1-in-3-SAT formula is constructed. Such a representation can be obtained efficiently through planar embedding [6]. Without loss of generality assume that the variables in G are aligned on a line L (e.g.…”