942 search results - page 47 / 189 » Constraints in Graph Drawing Algorithms |
143
Voted
INFOVIS
1997
IEEE
15 years 6 months ago
1997
IEEE
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
125
Voted
VIZSEC
2005
Springer
15 years 8 months ago
2005
Springer
While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective tech...
158
Voted
LCC
1994
15 years 6 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
130
click to vote
GD
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...
109
Voted
GD
2004
Springer
15 years 8 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...