Title
Heuristics and pedigrees for drawing directed graphs
Abstract
We describe here a collection of heuristics for produc ing "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 foun d in playing mode, the user can obtain insights into the best order in which the heuristics should be a pplied. 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 sim ilar to the steps of Sugiyama's D-ABDUCTOR graph-drawing package; and indeed we can obtain results simila r to those of D-ABDUCTOR, by applying our heuristics in the proper sequence.
Year
DOI
Venue
1999
10.1590/S0104-65001999000200004
J. Braz. Comp. Soc.
Keywords
Field
DocType
visualization,multivalued optimization,aesthetic criteria,proper sequence. keywords: graph drawing,a-team.,random sequence,graph drawing,directed graph,evaluation function
Software tool,Data mining,Asynchronous communication,Computer science,Random sequence,Evaluation function,Directed graph,Theoretical computer science,Heuristics,Artificial intelligence,Machine learning
Journal
Volume
Issue
Citations 
6
1
2
PageRank 
References 
Authors
0.42
8
3
Name
Order
Citations
PageRank
Jorge Stolfi11559296.06
do nascimento29912.30
Candido Ferreira Xavier de Mendonça Neto3174.33