Heuristics and Experimental Design for Bigraph Crossing Number Minimization

The bigraph crossing problem, embedding the two vertex sets of a bipartite graph G = (V0, V1, E) along two parallel lines so that edge crossings are minimized, has application to circuit layout and graph drawing. We consider the case where both V0 and V1 can be permuted arbitrarily -- both this and the case where the order of one vertex set is fixed are NP-hard. Two new heuristics that perform well on sparse graphs such as occur in circuit layout problems are presented. The new heuristics outperform existing heuristics on graph classes that range from application-specific to random. Our experimental design methodology ensures that differences in performance are statistically significant and not the result of minor variations in graph structure or input order.

[1]  Malgorzata Marek-Sadowska,et al.  The crossing distribution problem , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[2]  Petra Mutzel,et al.  AGD - A Library of Algorithms for Graph Drawing , 1998, Graph Drawing Software.

[3]  Matthias F. Stallmann,et al.  Hypercrossing Number: A New and Effective Cost Function for Cell Placement Optimization , 1998 .

[4]  Nevin Kapur,et al.  Synthesis of wiring signature-invariant equivalence class circuit mutants and applications to benchmarking , 1998, Proceedings Design, Automation and Test in Europe.

[5]  Farhad Shahrokhi,et al.  On Bipartite Crossings, Largest Biplanar Subgraphs, and the Linear Arrangement Problem , 1997, WADS.

[6]  C. Thomborson,et al.  Area-time complexity for VLSI , 1979, STOC.

[7]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..

[8]  Xuemin Lin,et al.  How to draw a directed graph , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

[9]  Franc BrglezApril.  Design of Experiments to Evaluate CAD Algorithms: Which Improvements Are Due to Improved Heuristic and Which Are Merely Due to Chance? , 1998 .

[10]  W. T. Tutte.  Convex Representations of Graphs , 1960 .

[11]  Frank Harary,et al.  Trees with Hamiltonian square , 1971 .

[12]  Peter Eades,et al.  Drawing Graphs in Two Layers , 1994, Theor. Comput. Sci..

[13]  Farhad Shahrokhi,et al.  On Bipartite Drawings and the Linear Arrangement Problem , 2001, SIAM J. Comput..

[14]  W. T. Tutte.  How to Draw a Graph , 1963 .

[15]  F. Brglez,et al.  Design of experiments in BDD variable ordering: lessons learned , 1998, 1998 IEEE/ACM International Conference on Computer-Aided Design. Digest of Technical Papers (IEEE Cat. No.98CB36287).

[16]  Erkki Mäkinen,et al.  Experiments on drawing 2-level hierarchical graphs , 1990, Int. J. Comput. Math..

[17]  Malgorzata Marek-Sadowska,et al.  The crossing distribution problem [IC layout] , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  John N. Warfield,et al.  Crossing Theory and Hierarchy Mapping , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[19]  Brendan D. McKay,et al.  On an edge crossing problem , 1986 .

[20]  Michael Jünger,et al.  Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .

[21]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .