Large Quasi-Tree Drawing: A Neighborhood Based Approach

Romain Bourqui , David Auber (1, 2)

1 LaBRI - Laboratoire Bordelais de Recherche en Informatique
2 GRAVITE - Graph Visualization and Interactive Exploration

In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects have shown the interest of devicing dedicated tools for visualizing such graphs. Our method addresses a challenging problem which consists in computing a layout of large graphs (up to hundred of thousands of nodes) that emphasizes their tree-like property in an efficient time. In order to validate our approach, we compare our results on real data to those obtained by well known algorithms.

Domains: Data Structures and Algorithms [cs.DS]

Romain Bourqui, David Auber. Large Quasi-Tree Drawing: A Neighborhood Based Approach. 13th International Conference on Information Visualisation, Jul 2009, Spain. pp.653-660. ⟨hal-00406435⟩