Heuristics and Experimental Design for Bigraph Crossing Number Minimization

Authors:
Matthias Stallmann;Franc Brglez;Debabrata Ghosh
Affiliations:
-;-;-
Venue:
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Year:
1999

Citing 8
Cited 0

How to draw a directed graph

Journal of Information Processing
Drawing graphs in two layers

Theoretical Computer Science
Design of experiments in BDD variable ordering: lessons learned

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Synthesis of wiring signature-invariant equivalence class circuit mutants and applications to benchmarking

Proceedings of the conference on Design, automation and test in Europe
Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs
A Technique for Drawing Directed Graphs

IEEE Transactions on Software Engineering
Area-time complexity for VLSI

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The crossing distribution problem [IC layout]

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.