Large Quasi-Tree Drawing: A Neighborhood Based Approach

Romain Bourqui David Auber 1, 2
2 GRAVITE - Graph Visualization and Interactive Exploration
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download
Contributor : Romain Bourqui <>
Submitted on : Wednesday, July 22, 2009 - 11:32:47 AM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM
Long-term archiving on : Tuesday, June 15, 2010 - 9:01:32 PM


Files produced by the author(s)


  • HAL Id : hal-00406435, version 1


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⟩



Record views


Files downloads