Large-Graph Layout Algorithms at Work: An Experimental Study

Hachul, Stefan and J√ľnger, Michael (2007) Large-Graph Layout Algorithms at Work: An Experimental Study.
Published in: Journal of Graph Algorithms and Applications Vol. 11 (21). pp. 345-369.

Abstract

In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are based on force-directed or algebraic approaches in terms of running time and drawing quality on a big variety of artificial and real-world graphs. Our experiments indicate that there exist significant differences in drawing qualities and running times depending on the classes of tested graphs and algorithms.


Actions:
Download: [img] PDF - Preprinted Version
Download (8MB) | Preview
Export as: [error in script]
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: [error in script] 13 (Google Scholar) | [error in script]
Uncontrolled Keywords: [error in script]
Subjects:
  • 68-XX Computer science > 68Uxx Computing methodologies and applications > 68U05 Computer graphics; computational geometry

  • 68-XX Computer science > 68Wxx Algorithms > 68W01 General

  • Uncontrolled Keywords: experimental study, graph drawing, large graphs
    Subjects: 68-XX Computer science > 68Uxx Computing methodologies and applications > 68U05 Computer graphics; computational geometry
    68-XX Computer science > 68Wxx Algorithms > 68W01 General
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
    Depositing User: Stefan Hachul
    Date Deposited: 16 Jan 2006 00:00
    Last Modified: 09 Jan 2012 16:39
    Deposit Information:
    ZAIK Number: [error in script]
    Depositing User: Stefan Hachul
    Date Deposited: 16 Jan 2006 00:00
    Last Modified: 09 Jan 2012 16:39
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/510