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 \emph{bundles}. Each edge can participate in many such bundles. Any crossing in this bundled graph occurs between two bundles, i.e., as a \emph{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 bundled crossings. We show that the problem is NP-hard when we require a simple drawing. Our main result is an FPT algorithm (in ) when we require a simple circular layout. These results make use of the connection between bundled crossings and graph genus.
Cite
@article{arxiv.1812.04263,
title = {Bundled Crossings Revisited},
author = {Steven Chaplick and Thomas C. van Dijk and Myroslav Kryven and Ji-won Park and Alexander Ravsky and Alexander Wolff},
journal= {arXiv preprint arXiv:1812.04263},
year = {2022}
}
Comments
Appears in the Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019)