Skip to Main content Skip to Navigation
Journal articles

Bundled Crossings Revisited

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [38 references]  Display  Hide  Download

https://hal.inria.fr/hal-02972975
Contributor : Ji-Won Park <>
Submitted on : Tuesday, October 20, 2020 - 5:29:01 PM
Last modification on : Friday, October 23, 2020 - 11:04:54 AM

File

535.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

21

Files downloads

61