Optimal linear labelings and eigenvalues of graphs
Discrete Applied Mathematics
The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
Matrix market: a web resource for test matrix collections
Proceedings of the IFIP TC2/WG2.5 working conference on Quality of numerical software: assessment and enhancement
Drawing graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
A Multi-scale Algorithm for the Linear Arrangement Problem
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Breaking cycles for minimizing crossings
Journal of Experimental Algorithmics (JEA)
Visual Analysis Tool for Bipartite Networks
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
Anchored Map: Graph Drawing Technique to Support Network Mining
IEICE - Transactions on Information and Systems
Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D
Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques
GD'04 Proceedings of the 12th international conference on Graph Drawing
New exact results and bounds for bipartite crossing numbers of meshes
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |
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.