Affordable Access

Two New Heuristics for Two-Sided Bipartite Graph Drawing

Authors
Publisher
Springer Berlin / Heidelberg
Publication Date
Keywords
  • G.999 Others
  • G.420 Crossings
Disciplines
  • Mathematics

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.

There are no comments yet on this publication. Be the first to share your thoughts.