Bundled Crossings Revisited - Archive ouverte HAL Access content directly
Journal Articles Journal of Graph Algorithms and Applications Year : 2020

Bundled Crossings Revisited

(1, 2) , (2) , (2) , (3) , (4) , (2)


An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into bundles. Each edge can participate in many such bundles. Any crossing in this bundled graph occurs between two bundles, i.e., as a bundled crossing. We consider the problem of bundled crossing minimization: A graph is given and the goal is to find a bundled drawing with at most k bundled crossings. We show that the problem is NP-hard when we require a simple drawing. Our main result is an FPT algorithm (in k) for simple circular layouts where vertices must be placed on a circle and edges must be drawn inside the circle. These results make use of the connection between bundled crossings and graph genus. We also consider bundling crossings in a given drawing, in particular for storyline visualizations.
Fichier principal
Vignette du fichier
535.pdf (1.26 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02972975 , version 1 (20-10-2020)



Steven Chaplick, Thomas C van Dijk, Myroslav Kryven, Ji-Won Park, Alexander Ravsky, et al.. Bundled Crossings Revisited. Journal of Graph Algorithms and Applications, 2020, ⟨10.7155/jgaa.00534⟩. ⟨hal-02972975⟩
40 View
89 Download



Gmail Facebook Twitter LinkedIn More