942 search results - page 24 / 189 » Constraints in Graph Drawing Algorithms |
126
Voted
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
112
click to vote
CVPR
2001
IEEE
16 years 4 months ago
2001
IEEE
This paper presents a novel approach for recognizing and interpreting dimensions in engineering drawings. It starts by detecting potential dimension frames, each comprising only t...
128
Voted
GD
2009
Springer
15 years 7 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
110
Voted
JGAA
2000
15 years 2 months ago
2000
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
127
Voted
INFORMS
2010
14 years 12 months ago
2010
The quadratic linear ordering problem naturally generalizes various optimization problems, such as bipartite crossing minimization or the betweenness problem, which includes linear...