Hunting Down Graph B

Brandes, Ulrik (1999) Hunting Down Graph B. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 410-415 (Official URL: http://dx.doi.org/10.1007/3-540-46648-7_42).

Full text not available from this repository.

Abstract

Graph B, the "Theory Graph", of the 1999 Graph Drawing Contest is visually explored using available and some hand-written graph drawing software.

Item Type:Conference Paper
Additional Information:10.1007/3-540-46648-7_42
Classifications:A General Literature > A.002 Conference Related
ID Code:380

Repository Staff Only: item control page

References

Thomas M. J. Fruchterman and Edward M. Reingold. Graph-drawing by force-directed placement. Software-Practice and Experience, 21(11):1129-1164, 1991.

Kurt Mehlhorn and Stefan Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999. Project home page at http://www.mpi-sb.mpg.de/LEDA/.

Petra Mutzel, Carsten Gutwenger, Ralf Brockenauer, Sergej Fialko, Gunnar W. Klau, Michael Krüger, Thomas Ziegler, Stefan Näher, David Alberts, Dirk Ambras, Gunter Koch, Michael Jünger, Christoph Buchheim, and Sebastian Leipert. A library of algorithms for graph drawing. In Sue H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD '98), volume 1547 of Lecture Notes in Computer Science, pages 456-457. Springer, 1998. Project home page at http://www. mpi-sb.mpg.de/AGD/.

Kozo Sugiyama, Shojiro Tagawa, and Mitsuhiko Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109-125, 1981.