Two New Heuristics for Two-Sided Bipartite Graph Drawing

Newton, Matthew and Sýkora, Ondrej and Vrt'o, Imrich (2002) Two New Heuristics for Two-Sided Bipartite Graph Drawing. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 312-319(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_29).

Full text not available from this repository.

Abstract

Two new heuristic strategies are studied based on heuristics for the linear arrangement problem and a stochastic hill-climbing method for the two-sided bipartite crossing number problem. These are compared to the standard heuristic for two-sided bipartite drawing based on iteration of the barycentre method. Our experiments show that they can efficiently find good solutions.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-36151-0_29
Classifications: G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.420 Crossings
URI: http://gdea.informatik.uni-koeln.de/id/eprint/208

Actions (login required)

View Item View Item