Skip to main content
Conference ProceedingsOPEN ACCESS

Two new heuristics for two-sided bipartite graph drawing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2528 LNCS 312-319
DOI: 10.1007/3-540-36151-0_29
19Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Newton, M., Sýkora, O., & Vrt’o, I. (2002). Two new heuristics for two-sided bipartite graph drawing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2528 LNCS, pp. 312–319). https://doi.org/10.1007/3-540-36151-0_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free