—In this paper, we present the results of a human computer interaction experiment that compared the performance of the animation of dynamic graphs to the presentation of small mu...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Abstract. Several algorithms, namely CubeMiner, Trias, and DataPeeler, have been recently proposed to mine closed patterns in ternary relations. We consider here the specific cont...
The paper describes a novel technique to visualize graphs with extended node and link labels. The lengths of these labels range from a short phrase to a full sentence to an entire...
Pak Chung Wong, Patrick Mackey, Ken Perrine, James...