Minimizing crossings in constrained two-sided circular graph layouts.

DOI10.20382/jocg.v10i2a4zbMath1494.68199arXiv1803.05705OpenAlexW2990630328MaRDI QIDQ5207872

Martin Nöllenburg, Fabian Klute

Publication date: 13 January 2020

Full work available at URL: https://arxiv.org/abs/1803.05705

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Parameterized analysis and crossing minimization problems ⋮ Crossing edge minimization in radial outerplanar layered graphs using segment paths ⋮ Treewidth, Circle Graphs, and Circular Drawings

This page was built for publication: Minimizing crossings in constrained two-sided circular graph layouts.