A note on computing a maximal planar subgraph using PQ-trees
نویسندگان
چکیده
منابع مشابه
A note on computing a maximal planar subgraph using PQ-trees
The problem of computing a maximal planar subgraph of a non planar graph has been deeply investigated over the last 20 years. Several attempts have been tried to solve the problem with the help of P Q-trees. The latest attempt has been reported by Jayakumar et al. 10]. In this paper we show that the algorithm presented by Jayakumar et al. is not correct. We show that it does not necessarily com...
متن کاملA Note on the Practicality of Maximal Planar Subgraph Algorithms
Given a graph G, the NP-hard Maximum Planar Subgraph problem (MPS) asks for a planar subgraph of G with the maximum number of edges. There are several heuristic, approximative, and exact algorithms to tackle the problem, but—to the best of our knowledge— they have never been compared competitively in practice. We report on an exploratory study on the relative merits of the diverse approaches, f...
متن کاملA Linear Algorithm for Embedding Planar Graphs Using PQ-Trees
This paper presents a simple linear algorithm for embedding (or drawing) a planar graph in the plane. The algorithm is based on the “vertex-addition” algorithm of Lempel, Even, and Cederbaum (“Theory of Graphs,” Intl. Sympos. Rome, July 1966, pp. 21>232, Gordon & Breach, New York, 1967) for the planarity testing, and is a modification of Booth and Lueker’s (J. Comput. System Sci. 13 (1976), 335...
متن کاملA Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees
In Shih & Hsu, a planarity test was introduced utilizing a data structure called PC-trees, generalized from PQ-trees. They illustrated that a PC-tree is more natural IN representing planar graphs. Their algorithm starts by constructing a depth-first-search tree and adds all back edges to a vertex one by one. A major feature in the S&H algorithm is that, at each iteration, at most two terminal n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 1998
ISSN: 0278-0070
DOI: 10.1109/43.709399