An improved bound on the one-sided minimum crossing number in two-layered drawings
From MaRDI portal
Publication:2484013
DOI10.1007/s00454-005-1168-0zbMath1066.05059OpenAlexW2079962198MaRDI QIDQ2484013
Publication date: 2 August 2005
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-005-1168-0
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (12)
The slotted online one-sided crossing minimization problem on 2-regular graphs ⋮ Drawing (complete) binary tanglegrams ⋮ 2-Layer Graph Drawings with Bounded Pathwidth ⋮ Fixed parameter algorithms for one-sided crossing minimization revisited ⋮ Ranking and Drawing in Subexponential Time ⋮ A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization ⋮ Crossing minimization in extended level drawings of graphs ⋮ On the one-sided crossing minimization in a bipartite graph with large degrees ⋮ Approximation algorithms for minimizing edge crossings in radial drawings ⋮ On the complexity of crossings in permutations ⋮ Bipartite Graph Representation of Multiple Decision Table Classifiers ⋮ Crossing minimization in weighted bipartite graphs
This page was built for publication: An improved bound on the one-sided minimum crossing number in two-layered drawings
