An Improved Approximation to the OneSided Bilayer DrawingNagamochi, Hiroshi (2004) An Improved Approximation to the OneSided Bilayer Drawing. In: Graph Drawing 11th International Symposium, GD 2003, September 2124, 2003 , pp. 406418(Official URL: http://dx.doi.org/10.1007/9783540245957_38). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/9783540245957_38
AbstractGiven a bipartite graph G=(V,W,E), a bilayer drawing consists of placing nodes in the first vertex set V on a straight line L_1 and placing nodes in the second vertex set W on a parallel line L_2. The onesided crossing minimization problem asks to find an ordering of nodes in V to be placed on L_1 so that the number of arc crossings is minimized. In this paper, we prove that there always exits a solution whose crossing number is at most 1.4664 times of a wellknown lower bound that is obtained by summing up min{c_{uv}, c_{vu}} over all node pairs u, v \epsilon V, where c_uv denotes the number of crossings generated by arcs incident to u and v when u precedes v in an ordering.
Actions (login required)
