Bundled Crossings Revisited

Steven Chaplick, Thomas C. van Dijk, Myroslav Kryven, Ji-won Park, Alexander Ravsky, Alexander Wolff

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

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) when we require a simple circular layout. These results make use of the connection between bundled crossings and graph genus.

Original languageEnglish
Title of host publication Graph Drawing and Network Visualization. GD 2019
EditorsD. Archambault, C. Tóth
Pages63-77
Number of pages15
ISBN (Electronic)978-3-030-35802-0
DOIs
Publication statusPublished - 2019
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science
Volume11904
ISSN0302-9743

Keywords

  • EMBEDDING GRAPHS
  • GENUS
  • LINEAR-TIME ALGORITHM
  • VISUALIZATION

Cite this