Heuristics and Experimental Design for Bigraph Crossing Number Minimization

@inproceedings{Stallmann1999HeuristicsAE,
  title={Heuristics and Experimental Design for Bigraph Crossing Number Minimization},
  author={Matthias F. Stallmann and Franc Brglez and Debabrata Ghosh},
  booktitle={ALENEX},
  year={1999}
}
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 xed are NP-hard. Two new heuristics that perform well on sparse graphs such as occur in circuit layout problems are presented. The new heuristics… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 22 references

A Technique for Drawing Directed Graphs

E. R. Gansner, E. Koutsifios, S. C. North, K. P. Vo
IEEE Trans. Software Engg., 19 • 1993
View 5 Excerpts
Highly Influenced

Crossing Number is NP-complete

M. R. Garey, D. S. Johnson
SIAM J. Algebraic Discrete Methods, 4 • 1983
View 3 Excerpts
Highly Influenced

The AGD-Library: Algorithms for Graph Drawing, 1998. Available from http://www.mpi-sb.mpg.de/~mutzel/dfgdraw/agdlib.html

P. Mutzel
1998
View 1 Excerpt

A CBL PosterNote: Wire Crossing Problem and Benchmarking, aug

F. Brglez, N. Kapur, D. Ghosh
1997
View 1 Excerpt

O

F. Shahrokhi
S ykora, L. A. Sz ekely, and I. Vrt'o, On bipartite drawings and the linear arrangement problem, in Lecture Notes in Computer Science, no. 1467, Springer Verlag • 1997
View 1 Excerpt

Similar Papers

Loading similar papers…