Sciweavers

CORR
2012
Springer
249views Education» more  CORR 2012»
12 years 7 months ago
Computing Cartograms with Optimal Complexity
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
Md. Jawaherul Alam, Therese C. Biedl, Stefan Felsn...
GD
2006
Springer
14 years 3 months ago
Partitions of Graphs into Trees
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
Therese C. Biedl, Franz-Josef Brandenburg