A Multi-agent Approach using A-Teams for Graph Drawing

Graph drawing consists of producing good drawings of graphs, given the vertices and edges (see Figure 1). In general, a ‘good’ drawing exhibits some aesthetic criteria and/or satisfies some constraints in order to make the drawing pleasant and legible for human eyes. Examples of desirable aesthetic criteria described in the literature [1,2,3,4,5,6] are: • show few edges crossings, • show symmetry, • uniformly distribute the vertices and edges in the space provided for the drawing, • show edges in an uniform direction as much as possible (for directed graphs), and • avoid long edges. In a specific application, there may be some constraints. For example, one can consider to draw a specific vertex or edge in a particular way, using a different graphical standard, or to draw a selected group of vertices very close to each other. Graph drawing methods have applications in many branches of computing such as in software engineering (for drawing subroutine-call graphs, object-oriented class hierarchies, etc.) and in database (for showing entity-relationship diagrams). Figure 1: Graph drawing activity.

[1]  John N. Warfield,et al.  World dynamics , 1973 .

[2]  Pedro S. de Souza,et al.  Asynchronous organizations for multi-algorithm problems , 1993, SAC '93.

[3]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (3rd ed.) , 1996 .

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  N Mendonca,et al.  A layout system for information system diagrams , 1994 .

[6]  Jorge Stolfi,et al.  Heuristics and pedigrees for drawing directed graphs , 1999, J. Braz. Comput. Soc..

[7]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[8]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[9]  Shuji Hashimoto,et al.  Proceedings of the IEEE International Conference on Systems, Man and Cybernetics , 1998 .

[10]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[11]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[12]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[13]  Hartmut Schmeck,et al.  An Evolutionary Algorithm for Drawing Directed Graphs , 1998 .

[14]  S.N. Talukdar,et al.  Scale efficient organizations , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.

[15]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[16]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[17]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..