@fink

Drawing Graphs within Restricted Area

, , , and . Proceedings of the 22nd International Symposium on Graph Drawing (GD '14), volume 8871 of Lecture Notes in Computer Science, page 367-379. Springer-Verlag, (2014)

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.

Links and resources

Tags

community

  • @awolff
  • @dblp
  • @fink
@fink's tags highlighted