Adocs: a Drawing System for Generic Combinatorial Structures

Bertault, François (1996) Adocs: a Drawing System for Generic Combinatorial Structures. In: Symposium on Graph Drawing, GD 1995, September 20-22, 1995, Passau, Germany , pp. 24-27 (Official URL:

Full text not available from this repository.


Existing graph drawing systems imply the use of specific algorithms for each kind of data structures. This paper provide a description of the Adocs program. The program is based on a generic description of the structures, and thus allows to draw structures of an infinite number of classes. It can be used in order to produce graphical output for Gaïa, an uniform random generator of combinatorial structures. It could be used with other programs and is well suited for drawing compound objects.

Item Type:Conference Paper
Additional Information:10.1007/BFb0021787
Classifications:J Applications > J.001 General
S Software and Systems > S.001 General
ID Code:44

Repository Staff Only: item control page


Philippe Flajolet, Paul Zimmermann, and Bernard Van Cutsem. A calculus for the random generation of labelled combinatorial structures. Theoretical Computer Science, 132(1-2):1-35, 1994.

Eades Peter D. Drawing free trees. Bulletin of the Institute for Combinatorics and its Aplications, 5(2):10-36, 1992.

Edward M. Reingold and John S. Tilford. Tidier drawings of trees. IEEE Transactions on Software Engineering, SE-7(2):223-228, March 1981.

Paul Zimmermannn. Gaïa: a package for the random generation of combinatorial structures. MapleTech, 1(1):38-46, 1994.