Minimizing crossings in constrained two-sided circular graph layouts

Fabian Klute, Martin Nöllenburg
April 2017
PDF bib

Abstract

Full Citation:

Fabian Klute, Martin Nöllenburg. Minimizing crossings in constrained two-sided circular graph layouts. European Workshop on Computational Geometry (EuroCG'17), pages 265–268, April 2017.

Type
Conference Paper
Martin Nöllenburg
Martin Nöllenburg

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