Strict Confluent Drawing
From MaRDI portal
Publication:2970442
DOI10.20382/jocg.v7i1a2zbMath1405.68245arXiv1308.6824OpenAlexW4300081104MaRDI QIDQ2970442
Bettina Speckmann, David Eppstein, Kevin Verbeek, Maarten Löffler, Danny Holten, Martin Nöllenburg
Publication date: 30 March 2017
Full work available at URL: https://arxiv.org/abs/1308.6824
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
On Strict (Outer-)Confluent Graphs ⋮ Approximating the Bundled Crossing Number ⋮ On strict (outer-)confluent graphs ⋮ Crossing Layout in Non-planar Graph Drawings
This page was built for publication: Strict Confluent Drawing
