Computer aided layout of entity relationship diagrams
Journal of Systems and Software - Special double issue on the entity-relationship approach to databases and related software
SIAM Journal on Computing
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
A Linear Time Implementation of SPQR-Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A New Approach to Exact Crossing Minimization
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Inserting a vertex into a planar graph
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the crossing number of almost planar graphs
GD'06 Proceedings of the 14th international conference on Graph drawing
A tighter insertion-based approximation of the crossing number
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Vertex insertion approximates the crossing number of apex graphs
European Journal of Combinatorics
On graph crossing number and edge planarization
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A note on computing a maximal planar subgraph using PQ-trees
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
The planarization method is the strongest known method to heuristically find good solutions to the general crossing number problem in graphs: starting from a planar subgraph, one iteratively inserts edges, representing crossings via dummy nodes. In the recent years, several improvements both from the practical and the theoretical point of view have been made. We review these advances and conduct an extensive study of the algorithms' practical implications. Thereby, we present the first implementation of an approximation algorithm for the crossing number problem of general graphs, and compare the obtained results with known exact crossing number solutions.