942 search results - page 43 / 189 » Constraints in Graph Drawing Algorithms |
109
click to vote
TIP
2010
14 years 9 months ago
2010
One weakness in the existing interactive image segmentation algorithms is the lack of more intelligent ways to understand the intention of user inputs. In this paper, we advocate t...
124
Voted
CPAIOR
2004
Springer
15 years 6 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
118
Voted
SAC
2009
ACM
15 years 9 months ago
2009
ACM
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
109
Voted
ICRA
2010
IEEE
15 years 1 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
98
Voted
GD
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...