Sciweavers

369 search results - page 43 / 74
» Layouts of Graph Subdivisions
Sort
View
INFOVIS
1999
IEEE
14 years 1 months ago
Constellation: A Visualization Tool for Linguistic Queries from MindNet
ct Constellation is a visualization system for the results of queries from the MindNet natural language semantic network. Constellation is targeted at helping MindNet's creato...
Tamara Munzner, François Guimbretièr...
CGF
2008
110views more  CGF 2008»
13 years 8 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
GD
2007
Springer
14 years 2 months ago
Drawing Graphs with GLEE
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
Lev Nachmanson, George G. Robertson, Bongshin Lee
JPDC
2006
134views more  JPDC 2006»
13 years 8 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
VLC
2002
93views more  VLC 2002»
13 years 8 months ago
Metrics for Graph Drawing Aesthetics
Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
Helen C. Purchase