A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
From MaRDI portal
Publication:3611983
DOI10.1007/978-3-540-73556-4_32zbMath1175.05129OpenAlexW2119604897MaRDI 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
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Parameterized analysis and crossing minimization problems ⋮ Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization ⋮ Approximation algorithms for minimizing edge crossings in radial drawings ⋮ A linear edge kernel for two-layer crossing minimization ⋮ Connecting the dots (with minimum crossings)
Uses Software
This page was built for publication: A New Exact Algorithm for the Two-Sided Crossing Minimization Problem
