Sommaire

Approximation algorithms for some graph partitioning problems.

He, G. ; Liu, J. ; Zhao, C.

Full (PDF)
p. 1-11

The Electronic Library of Mathematics
Geometric thickness of complete graphs.

Dillencourt, Michael B. ; Eppstein, David ; Hirschberg, Daniel S.

Full (PDF)
p. 5-17,

The Electronic Library of Mathematics
Balanced aspect ratio trees and their use for drawing large graphs.

Duncan, Christian A. ; Goodrich, Michael T. ; Kobourov, Stephen G.

Full (PDF)
p. 19-46

The Electronic Library of Mathematics
Difference metrics for interactive orthogonal graph drawing algorithms.

Bridgeman, Stina ; Tamassia, Roberto

Full (PDF)
p. 47-74

The Electronic Library of Mathematics
Techniques for the refinement of orthogonal graph drawings.

Six, Janet M. ; Kakoulis, Konstantinos G. ; Tollis, Ioannis G.

Full (PDF)
p. 75-103

The Electronic Library of Mathematics
A split&push approach to 3D orthogonal drawing.

Di Battista, Giuseppe ; Patrignani, Maurizio

Full (PDF)
p. 105-133

The Electronic Library of Mathematics
Using graph layout to visualize train interconnection data.

Brandes, Ulrik ; Wagner, Dorothea

Full (PDF)
p. 135-155

The Electronic Library of Mathematics
Navigating clustered graphs using force-directed methods.

Eades, Peter ; Huang, Lin Mao

Full (PDF)
p. 157-181

The Electronic Library of Mathematics
Dynamic WWW structures in 3D.

Brandes, Ulrik ; Kääb, Vanessa ; Löh, Andres ; Wagner, Dorothea ; Willhalm, Thomas

Full (PDF)
p. 183-191

The Electronic Library of Mathematics