Universität zu Köln

Gronemann, Martin ORCID: 0000-0003-2565-090X, Jünger, Michael, Mallach, Sven ORCID: 0000-0001-5335-0678 and Schmidt, Daniel R. ORCID: 0000-0001-7381-912X (2011). Towards shortest longest edges in orthogonal graph drawing. ["eprint_fieldopt_monograph_type_preprint" not defined].

Preview

PDF zaik2011-634.pdf - Submitted Version Download (130kB) | Preview

Abstract

Inspired by a challenge during Graph Drawing 2010 "Find an orthogonal drawing whose longest edge is as short as possible", we investigate techniques to incorporate this goal into the "standard" topology-shape-metrics approach at moderate extra computational complexity. Experiments indicate that this project is worth pursuing.

Item Type:	Preprints, Working Papers or Reports (["eprint_fieldopt_monograph_type_preprint" not defined])
Creators:	Creators Email ORCID ORCID Put Code Gronemann, Martin UNSPECIFIED orcid.org/0000-0003-2565-090X UNSPECIFIED Jünger, Michael UNSPECIFIED UNSPECIFIED UNSPECIFIED Mallach, Sven UNSPECIFIED orcid.org/0000-0001-5335-0678 UNSPECIFIED Schmidt, Daniel R. UNSPECIFIED orcid.org/0000-0001-7381-912X UNSPECIFIED
URN:	urn:nbn:de:hbz:38-550212
Page Range:	p. 6
Date:	June 2011
Language:	English
Faculty:	Faculty of Mathematics and Natural Sciences
Divisions:	Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects:	Data processing Computer science
Refereed:	No
URI:	http://kups.ub.uni-koeln.de/id/eprint/55021