Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts

Klute, Fabian, Martin Nöllenburg
January 2018
PDF bib DOI

Abstract

Full Citation:

Klute, Fabian, Nöllenburg, Martin. Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. Computational Geometry (SoCG'18) (Speckmann, Bettina and Tóth, Csaba D.), pages 53:1-53:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Type
Conference Paper
Martin Nöllenburg
Martin Nöllenburg

Martin Nöllenburg is a Professor at the Algorithms and Complexity Group.