5889 search results - page 294 / 1178 » Graph Layout Problems |
190
click to vote
GD
2003
Springer
15 years 12 months ago
2003
Springer
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
182
click to vote
GD
2006
Springer
15 years 10 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...
157
click to vote
CCCG
2007
15 years 8 months ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....
164
click to vote
AIPS
2006
15 years 8 months ago
2006
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
156
click to vote
IJCAI
2001
15 years 8 months ago
2001
We show that nodes of high degree tend to occur infrequently in random graphs but frequently in a wide variety of graphs associated with real world search problems. We then study ...