2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
From MaRDI portal
Publication:4381060
DOI10.7155/jgaa.00001zbMath0906.05068OpenAlexW2099281231MaRDI QIDQ4381060
Publication date: 1 April 1998
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/48063
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Algorithms for the fixed linear crossing number problem ⋮ Heuristics for the constrained incremental graph drawing problem ⋮ Counting edge crossings in a 2-layered drawing ⋮ Tabu search for the dynamic bipartite drawing problem ⋮ Semidefinite relaxations of ordering problems ⋮ Computing orthogonal drawings with the minimum number of bends ⋮ A semidefinite optimization approach to the target visitation problem ⋮ A rearrangement of adjacency matrix based approach for solving the crossing minimization problem ⋮ An FPT algorithm for bipartite vertex splitting ⋮ Visualizing evolving trees ⋮ A benchmark library and a comparison of heuristic methods for the linear ordering problem ⋮ DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY ⋮ 2-layer right angle crossing drawings ⋮ Crossing-constrained hierarchical drawings ⋮ Tabu search tutorial. A graph drawing application ⋮ Rejoinder on: ``Tabu search tutorial. A graph drawing application ⋮ Unnamed Item ⋮ Crossing minimization in extended level drawings of graphs ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ An analysis of some linear graph layout heuristics ⋮ On the one-sided crossing minimization in a bipartite graph with large degrees ⋮ Curve-constrained drawings of planar graphs ⋮ New semidefinite programming relaxations for the linear ordering and the traveling salesman problem ⋮ Approximation algorithms for minimizing edge crossings in radial drawings ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ Block-insertion-based algorithms for the linear ordering problem ⋮ Semidefinite relaxations for partitioning, assignment and ordering problems ⋮ On the complexity of crossings in permutations ⋮ Bipartite Graph Representation of Multiple Decision Table Classifiers ⋮ Advances in the theory and practice of graph drawing ⋮ A new lower bound for the bipartite crossing number with applications ⋮ Crossing minimization in weighted bipartite graphs ⋮ Tabu search for min-max edge crossing in graphs ⋮ Comments on: ``Tabu search tutorial. A graph drawing application ⋮ New bounds on the barycenter heuristic for bipartite graph drawing.
Uses Software
