Block Crossings in Storyline Visualizations

DOI10.7155/jgaa.00443zbMath1372.05222OpenAlexW3103000343MaRDI QIDQ5367027

Peter Markfelder, Martin Fink, Fabian Lipp, Thomas C. van Dijk, Alexander Wolff, Norbert Fischer, Subhash Suri, O. V. Ravskyj

Publication date: 12 October 2017

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00443

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Mathematics and literature (00A64)

Related Items (7)

On Strict (Outer-)Confluent Graphs ⋮ Approximating the Bundled Crossing Number ⋮ Block Crossings in Storyline Visualizations ⋮ Block crossings in one-sided tanglegrams ⋮ Bundled crossings revisited ⋮ Computing Storyline Visualizations with Few Block Crossings ⋮ Bundled Crossings Revisited

This page was built for publication: Block Crossings in Storyline Visualizations