Results 1 
5 of
5
The Thickness of Graphs: A Survey
 Graphs Combin
, 1998
"... We give a stateoftheart survey of the thickness of a graph from both a theoretical and a practical point of view. After summarizing the relevant results concerning this topological invariant of a graph, we deal with practical computation of the thickness. We present some modifications of a ba ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
We give a stateoftheart survey of the thickness of a graph from both a theoretical and a practical point of view. After summarizing the relevant results concerning this topological invariant of a graph, we deal with practical computation of the thickness. We present some modifications of a basic heuristic and investigate their usefulness for evaluating the thickness and determining a decomposition of a graph in planar subgraphs. Key words: Thickness, maximum planar subgraph, branch and cut 1 Introduction In VLSI circuit design, a chip is represented as a hypergraph consisting of nodes corresponding to macrocells and of hyperedges corresponding to the nets connecting the cells. A chipdesigner has to place the macrocells on a printed circuit board (which usually consists of superimposed layers), according to several designing rules. One of these requirements is to avoid crossings, since crossings lead to undesirable signals. It is therefore desirable to find ways to handle wi...
Inserting an Edge Into a Planar Graph
 Algorithmica
, 2000
"... Computing a crossing minimum drawing of a given planar graph G augmented by an additional edge e in which all crossings involve e, has been a long standing open problem in graph drawing. Alternatively, the problem can be stated as finding a planar combinatorial embedding of a planar graph G in which ..."
Abstract

Cited by 17 (8 self)
 Add to MetaCart
Computing a crossing minimum drawing of a given planar graph G augmented by an additional edge e in which all crossings involve e, has been a long standing open problem in graph drawing. Alternatively, the problem can be stated as finding a planar combinatorial embedding of a planar graph G in which the given edge e can be inserted with the minimum number of crossings. Many problems concerned with the optimization over the set of all combinatorial embeddings of a planar graph turned out to be NPhard. Surprisingly, we found a conceptually simple linear time algorithm based on SPQRtrees, which is able to find a crossing minimum solution.
Pitfalls of using PQTrees in Automatic Graph Drawing
, 1997
"... A number of erroneous attempts involving PQtrees in the context of automatic graph drawing algorithms have been presented in the literature in recent years. In order to prevent future research from constructing algorithms with similar errors we point out some of the major mistakes. In particula ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
A number of erroneous attempts involving PQtrees in the context of automatic graph drawing algorithms have been presented in the literature in recent years. In order to prevent future research from constructing algorithms with similar errors we point out some of the major mistakes. In particular, we examine erroneous usage of the PQtree data structure in algorithms for computing maximal planar subgraphs and an algorithm for testing leveled planarity of leveled directed acyclic graphs with several sources and sinks.
A Note on Computing a Maximal Planar Subgraph using PQTrees
, 1998
"... 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 PQtrees. The latest attempt has been reported by Jayakumar et al. [10]. In this paper we show that ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
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 PQtrees. 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 compute a maximal planar subgraph and we note that the same holds for a modified version of the algorithm presented by Kant [12]. Our conclusions most likely suggest not to use PQtrees at all for this specific problem.
Angewandte Mathematik und Informatik Universit at zu K oln
, 1998
"... 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 PQtrees. The latest attempt has been reported by Jayakumar et al. [10]. In this paper we show that the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
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 PQtrees. 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 compute a maximal planar subgraph and we note that the same holds for a modified version of the algorithm presented by Kant [12]. Our conclusions most likely suggest not to use PQtrees at all for this specific problem. 1 Introduction The minimum number of layers needed in the layout of printed circuit boards and integrated chips is equal to the thickness of the interconnection graph [15]. The thickness of a graph G is the minimum number of planar subgraphs whose union is G. In VLSI design the thickness problem is approximated by successively subtracting large planar subgraphs from a given nonplana...