Large quasi-tree drawing : a neighborhood based approach

R.Y. Bourqui, D. Auber

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

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.
Original languageEnglish
Title of host publicationProceedings 13th International Conference on Information Visualisation (IV'09, Barcelona, Spain, July 15-17, 2009)
PublisherInstitute of Electrical and Electronics Engineers
Pages653-660
ISBN (Print)978-0-7695-3733-7
DOIs
Publication statusPublished - 2009

Fingerprint Dive into the research topics of 'Large quasi-tree drawing : a neighborhood based approach'. Together they form a unique fingerprint.

Cite this