A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
From MaRDI portal
Publication:3611983
DOI10.1007/978-3-540-73556-4_32zbMath1175.05129MaRDI QIDQ3611983
Lanbo Zheng, Christoph Buchheim
Publication date: 3 March 2009
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-73556-4_32
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Connecting the dots (with minimum crossings), Approximation algorithms for minimizing edge crossings in radial drawings, A linear edge kernel for two-layer crossing minimization, Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization, Parameterized analysis and crossing minimization problems
Uses Software