Approximating crossing minimization in radial layouts

Authors:
Seok-Hee Hong;Hiroshi Nagamochi
Affiliations:
School of Information Technologies, University of Sydney;Department of Applied Mathematics and Physics, Kyoto University
Venue:
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Year:
2008

Citing 4
Cited 1

An Introduction to VLSI Physical Design

An Introduction to VLSI Physical Design
On Bipartite Drawings and the Linear Arrangement Problem

SIAM Journal on Computing
An Improved Bound on the One-Sided Minimum Crossing Number in Two-Layered Drawings

Discrete & Computational Geometry
A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information

IEEE Transactions on Visualization and Computer Graphics

Crossing minimization in extended level drawings of graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a crossing minimization problem of drawing a bipartite graph with a radial layout of two orbits. Radial layouts have strong application in social network visualization, displaying centrality of actors. The problem is called the one-sided crossing minimization if the positions of vertices in one of the two orbits are fixed, and is known to be NP-hard. We present the first approximation algorithm, proving that the one-sided crossing minimization in a radial layout is 15-approximable.