A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
From MaRDI portal
Publication:411236
DOI10.1007/s10878-010-9326-6zbMath1263.90113OpenAlexW2094686363MaRDI QIDQ411236
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9326-6
Related Items
Uses Software
Cites Work
- Unnamed Item
- A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs
- Heuristics and meta-heuristics for 2-layer straight line crossing minimization
- A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
- Exact Algorithms for the Quadratic Linear Ordering Problem
- Crossing Number is NP-Complete
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Crossing Minimization in Weighted Bipartite Graphs