Sciweavers

20 search results - page 4 / 4
» Drawing the AS Graph in 2.5 Dimensions
Sort
View
ICFCA
2004
Springer
13 years 10 months ago
Automated Lattice Drawing
Lattice diagrams, known as Hasse diagrams, have played an ever increasing role in lattice theory and fields that use lattices as a tool. Initially regarded with suspicion, they no...
Ralph Freese
DCG
2008
82views more  DCG 2008»
13 years 5 months ago
Schnyder Woods and Orthogonal Surfaces
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
Stefan Felsner, Florian Zickfeld
RSA
2011
157views more  RSA 2011»
13 years 8 days ago
The cover time of random geometric graphs
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denote the ball (disc) of radius r. Let Υd be the volume...
Colin Cooper, Alan M. Frieze
ICML
2008
IEEE
14 years 6 months ago
Graph kernels between point clouds
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
Francis R. Bach
WADS
2001
Springer
137views Algorithms» more  WADS 2001»
13 years 9 months ago
Visual Ranking of Link Structures
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...
Ulrik Brandes, Sabine Cornelsen