Drawing Graphs within Restricted Area

Aulbach, Maximilian and Fink, Martin and Schuhmann, Julian and Wolff, Alexander (2014) Drawing Graphs within Restricted Area. In: Graph Drawing 22nd International Symposium, GD 2014, September 24-26, 2014 , pp. 367-379(Official URL: http://dx.doi.org/10.1007/978-3-662-45803-7_31).

Full text not available from this repository.

Abstract

We study the problem of selecting a maximum-weight subgraph of a given graph such that the subgraph can be drawn within a prescribed drawing area subject to given non-uniform vertex sizes. We develop and analyze heuristics both for the general (undirected) case and for the use case of (directed) calculation graphs which are used to analyze the typical mistakes that high school students make when transforming mathematical expressions in the process of calculating, for example, sums of fractions.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-662-45803-7_31
Classifications: G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.560 Geometry
G Algorithms and Complexity > G.070 Area / Edge Length
G Algorithms and Complexity > G.999 Others
M Methods > M.400 Force-directed / Energy-based
M Methods > M.500 Layered
P Styles > P.480 Layered
Divisions: UNSPECIFIED
Depositing User: Administration GDEA
Date Deposited: 22 May 2015 12:47
Last Modified: 22 May 2015 12:47
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1447

Actions (login required)

View Item View Item