5889 search results - page 37 / 1178 » Graph Layout Problems |
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
We present a method to segment a collection of unlabeled images while exploiting automatically discovered appearance patterns shared between them. Given an unlabeled pool of multi...
STACS
1994
Springer
14 years 1 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
GD
2006
Springer
14 years 1 months ago
2006
Springer
Graph drawing software are now commonly used. However, the choice of a well-adapted program may be hard for an inexperienced user. This poster presents a website (http://www.polyte...
IV
2005
IEEE
14 years 3 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
ICCAD
1994
IEEE
14 years 2 months ago
1994
IEEE
We consider two versions of the problem of folding a stack of equal width components. In both versions, when a stack is folded, a routing penalty is incurred at the fold. In one v...