The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
A fast and effective heuristic for the feedback arc set problem
Information Processing Letters
Theoretical Computer Science
Approximate solution of NP optimization problems
Theoretical Computer Science
Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
An experimental study of the basis for graph drawing algorithms
Journal of Experimental Algorithmics (JEA)
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
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
One for the Price of Two: A Unified Approach for Approximating Covering Problems
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
A Library of Algorithms for Graph Drawing
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Combinatorial algorithms for feedback problems in directed graphs
Information Processing Letters
Divide-and-conquer approximation algorithms via spreading metrics
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
An approximation algorithm for the two-layered graph drawing problem
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Two New Heuristics for Two-Sided Bipartite Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Crossing minimization in weighted bipartite graphs
Journal of Discrete Algorithms
Crossing minimization in weighted bipartite graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
k-level crossing minimization is NP-hard for trees
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
A solution to bipartite drawing problem using genetic algorithm
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
GD'05 Proceedings of the 13th international conference on Graph Drawing
A fast and simple heuristic for constrained two-level crossing reduction
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
Crossing-constrained hierarchical drawings
Journal of Discrete Algorithms
Hi-index | 0.00 |
We consider the one-sided crossing minimization problem (CP):given a bipartite graph G and a permutationx0 of the vertices on a layer, find a perumuationx1 of the vertices on the other layer whichminimizes the number of edge crossings in any straightline drawingof G where vertices are placed on two parallel lines andsorted according to x0 and x1.Solving CP represents a fundamental step in the construction ofaesthetically pleasing layouts of heirarchies and directed graphs,but unfortunately this problem has been proved to beNP-complete.In this paper we address the strong relation between CP and theproblem of computing minimum feedback arc sets in directed graphsand we devise a enw approximation algorithm for CP, called PM, thatexploits this dependency. We experimantally and visually comparethe performance of PM with the performance of well-known algorithmsand of recent attractive strategies. Experiments are carried out ondifferent families of randomly generated graphs, on pathologicalinstances, and on real test sets. Performance indicators includeboth number of edge crossings and running time, as well asstructural measures of the problem instances. We found CP to be avery interesting and rich problem from a combinatorial point ofview. Our results clearly separate the behavior of the algorithms,proving the effectiveness of PM on most test sets and showingtradeoffs between quality of the solutions and running time.However, if the visual complexity of the drawings is considered, wefound no clear winner. This confirms the importance of optimizingalso other aesthetic criteria such as symmetry, edge length, andangular resolution.