A Natural Quadratic Approach to the Generalized Graph Layering Problem

Mallach, Sven (2019) A Natural Quadratic Approach to the Generalized Graph Layering Problem.
Published In: Graph Drawing and Network Visualization: 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings, Lecture Notes in Computer Science. 11904 Springer 12 August 2019, pp. 532-544.

This is the latest version of this item.

Abstract

We propose a new exact approach to the generalized graph layering problem that is based on a particular quadratic assignment formulation. It expresses, in a natural way, the associated layout restrictions and several possible objectives, such as a minimum total arc length, minimum number of reversed arcs, and minimum width, or the adaptation to a specific drawing area. Our computational experiments show a competitive performance compared to prior exact models.


Actions:
Full text not available from this repository.
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: UNSPECIFIED
Depositing User: Sven Mallach
Date Deposited: 29 Aug 2019 08:45
Last Modified: 05 Dec 2019 09:49
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/942

Available Versions of this Item