Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Heuristics and pedigrees for drawing directed graphs
Author: Stolfi, J.
Nascimento, H. A. D. do
Mendonça, C. F. X. de
Abstract: We describe here a collection of heuristics for producing nice- drawings of directed graphs, and a simple dual-mode software tool for testing and evaluating them. In playing mode, the heuristics are applied in random sequence over a set of drawings, in the manner of an asynchronous team (A-team). As new drawings are added to the set, others are deleted based on a multi-valued aesthetic evaluation function. By inspecting the pedigree of the best solutions found in playing mode, the user can obtain insights into the best order in which the heuristics should be applied. Then the user can test these insights in the working mode, where the heuristics are applied in a fixed sequence.Some of the heuristics that we describe here are similar to the steps of Sugiyama's D-ABDUCTOR graph-drawing package; and indeed we can obtain results similar to those of D-ABDUCTOR, by applying our heuristics in the proper sequence.
Subject: graph drawing
aesthetic criteria
multivalued optimization
Editor: Sociedade Brasileira de Computação
Rights: aberto
Identifier DOI: 10.1590/S0104-65001999000200004
Date Issue: 1-Jul-1999
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.