15073 search results - page 2523 / 3015 » Probabilistic algorithms for computing resultants |
189
click to vote
GD
1998
Springer
15 years 11 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
183
click to vote
LATIN
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Automatic graph drawers need to compute paths among vertices of a simple polygon which besides remaining in the interior need to exhibit certain aesthetic properties. Som...
162
click to vote
CHI
1997
ACM
15 years 11 months ago
1997
ACM
Hypertext interfaces are considered appropriate for information exploration tasks. The prohibitively expensive link creation effort, however, prevents traditional hypertext interf...
171
click to vote
PODC
1997
ACM
15 years 11 months ago
1997
ACM
Thispaperdescribesanewschemeforguaranteeingthattransactions in a client/server system observe consistent state while they are running. The scheme is presented in conjunction with ...
187
click to vote
GD
1997
Springer
15 years 11 months ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...