Bundled Crossings Revisited

Authors

  • Steven Chaplick
  • Thomas van Dijk
  • Myroslav Kryven
  • Ji-won Park
  • Alexander Ravsky
  • Alexander Wolff

DOI:

https://doi.org/10.7155/jgaa.00535

Keywords:

bundled crossings , circular layout , NP-hard , fixed-parameter tractable , storyline visualization , extended monadic second order logic

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.

Downloads

Download data is not yet available.

Downloads

Published

2020-12-01

How to Cite

Chaplick, S., van Dijk, T., Kryven, M., Park, J.- won, Ravsky, A., & Wolff, A. (2020). Bundled Crossings Revisited. Journal of Graph Algorithms and Applications, 24(4), 621–655. https://doi.org/10.7155/jgaa.00535