Tech Report

Visualization of Dynamic Chat Communication

This work is aimed at visualizing the dynamic behaviour of very large communication networks. The visualization of large graphs and networks is a crucial part of many applications, for which typical approaches are too demanding of computational resources. Since one of the most important issues is a visualization of the dynamic behaviour of graphs, special aspects of the visualization of huge graphs with dynamic behaviour are discussed. The paper describes an algorithm that speeds up the visualization of very large graphs and provides fast access to underlying data structures. It provides an adaptive data structure for general dynamic graphs and discusses the adaptation of this structure to very large communication networks. Our method supports several special tools for efficient analysis and evaluation of the graphs representing communication networks.

ID: kmi-02-05

Date: 2002

Author(s): Ondrej Novak, Marc Eisenstadt, Pavel Slavik

Resources:
Download PDF

View By

Other Publications

CONTACT US

Knowledge Media Institute
The Open University
Walton Hall
Milton Keynes
MK7 6AA
United Kingdom

Tel: +44 (0)1908 653800

Fax: +44 (0)1908 653169

Email: KMi Support

COMMENT

If you have any comments, suggestions or general feedback regarding our website, please email us at the address below.

Email: KMi Development Team