135
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
118
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
Node-link diagrams are widely used in information visualization to show relationships among data. However, when the size of data becomes very large, node-link diagrams will become ...
127
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
110
Voted
GD
2006
Springer
15 years 7 months ago
2006
Springer
129
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...