413 search results - page 11 / 83 » A user study on visualizing directed edges in graphs |
INFOVIS
2003
IEEE
14 years 27 days ago
2003
IEEE
Many networks under study in Information Visualization are “small world” networks. These networks first appeared in the study social networks and were shown to be relevant mod...
CGF
2008
13 years 7 months ago
2008
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...
AVI
2008
13 years 10 months ago
2008
Pointing on screen edges is a frequent task in our everyday use of computers. Screen edges can help stop cursor movements, requiring less precise movements from the user. Thus, po...
TSMC
1998
13 years 7 months ago
1998
: This paper presents a procedure for automatically drawing directed graphs. Our system, CG, uses a unique clan-based graph decomposition to determine intrinsic substructures (clan...
WEA
2009
Springer
14 years 2 months ago
2009
Springer
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...