๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Experimental studies on graph drawing algorithms

โœ Scribed by Luca Vismara; Giuseppe Di Battista; Ashim Garg; Giuseppe Liotta; Roberto Tamassia; Francesco Vargiu

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
1023 KB
Volume
30
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.

โœฆ Synopsis

Graph drawing plays an important role in the solution of many information visualization problems. Most of the graph drawing algorithms are accompanied by a theoretical analysis of their characteristics, but only extensive experimentations can assess the practical performance of graph drawing algorithms in reallife applications. In this paper, we describe the results of some of the most popular experimental studies on graph drawing algorithms. Each study presents an in-depth comparative analysis on a specific class of algorithms, namely, algorithms for orthogonal drawings, interactive algorithms, algorithms for hierarchical drawings, and force-directed and randomized algorithms.

๐Ÿ“œ SIMILAR VOLUMES

An algorithm for drawing planar graphs
An algorithm for drawing planar graphs
โœ Bor Plestenjak ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 382 KB ๐Ÿ‘ 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s

A Simple Linear Time Algorithm for Prope
A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs
โœ Xin He ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 219 KB

In this paper we introduce a new style of drawing a plane graph G, called proper ลฝ . box rectangular PBR drawing. It is defined to be a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a vertical line segment, and each face is dr

Constant Time Graph Algorithms on the Re
Constant Time Graph Algorithms on the Reconfigurable Multiple Bus Machine
โœ Jerry L. Trahan; Ramachandran Vaidyanathan; Chittur P. Subbaraman ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 413 KB

The reconfigurable multiple bus machine (RMBM) is a model of parallel computation based on reconfigurable buses. Unlike other reconfigurable bus-based models such as the reconfigurable mesh (R-Mesh), the RMBM separates the functions of processors and switches. In this paper, we present constant time