On Maximal Planarization of Nonplanar Graphs
نویسندگان
چکیده
K. THULASIRAMAN, R. JAYAKUMAR, at X can be rearranged such that all the descendant pertinent AND M. N. S. SWAMY leaves of X appear consecutively at either the left or the right end of the frontier, with at least one nonpertinent leaf appearing at Absrruct--In this paper, we first point out that the planarization althe other end of the frontier. gorithm due to Ozawa and Takabashi [4] does not in general produce a Type A: A node X is said to be Type A if the subtree rooted at maximal planar subgraph when applied on a nonplanar graph. However, we X can be rearranged such that all the descendant pertinent leaves prove that the algorithm produces a maximal planar subgraph in the case of X appear consecutively in the middle of the frontier with at of a complete graph. least one nonpertinent leaf appearing at each end of the frontier.
منابع مشابه
Branch-and-Bound Techniques for the Maximum Planar Subgraph Problem
We present branch-and-bound algorithms for nding a maximum planar subgraph of a nonplanar graph. The problem has important applications in circuit layout, automated graph drawing, and facility layout. The algorithms described utilize heuristics to obtain an initial lower bound for the size of a maximum planar subgraph, then apply a sequence of fast preliminary tests for planarity to eliminate i...
متن کاملAn Analysis of Heuristics for Graph
We analyze several heuristics for graph planarization, i.e., deleting the minimum number of edges from a nonplanar graph to make it planar. The problem is NP-hard, although some heuristics which perform well in practice have been reported. In particular, we compare the two principle methods, based on path addition and vertex addition, respectively, with a selective edge addition method, an incr...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملOn Heuristics for Determining the Thickness of a Graph
We present an empirical analysis of some heuristics for the graph thickness problem, i.e., decomposing a graph into the minimum number of planar subgraphs. The problem has applications in database systems, e.g., the layout of E-R diagrams. The heuristics are based on some algorithms for nding a maximal planar subgraph of a nonplanar graph. Empirical results show that a randomized heuristic is a...
متن کاملSpanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کامل