Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Journal of Graph Algorithms and Applications
Tome 4 (2000)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Approximations of Weighted Independent Set and Hereditary Subset Problems
Magnús Halldórsson
p. 1-16
Sommaire du
Fascicule no. 2
Approximation Algorithms for Some Graph Partitioning Problems
G. He
;
J. Liu
;
C. Zhao
p. 1-11
Sommaire du
Fascicule no. 3
Guest Editors' Foreword
Giuseppe Liotta
;
Sue Whitesides
p. 1-3
Geometric Thickness of Complete Graphs
Michael Dillencourt
;
David Eppstein
;
Daniel Hirschberg
p. 5-17
Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
Christian Duncan
;
Michael Goodrich
;
Stephen Kobourov
p. 19-46
Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms
Stina Bridgeman
;
Roberto Tamassia
p. 47-74
Techniques for the Refinement of Orthogonal Graph Drawings
Janet Six
;
Konstantinos Kakoulis
;
Ioannis Tollis
p. 75-103
A Split Approach to 3D Orthogonal Drawing
Giuseppe Di Battista
;
Maurizio Patrignani
;
Francesco Vargiu
p. 105-133
Using Graph Layout to Visualize Train Interconnection Data
Ulrik Brandes
;
Dorothea Wagner
p. 135-155
Navigating Clustered Graphs Using Force-Directed Methods
Peter Eades
;
Mao Lin Huang
p. 157-181
Dynamic WWW Structures in 3D
Ulrik Brandes
;
Vanessa Kääb
;
Andres Löh
;
Dorothea Wagner
;
Thomas Willhalm
p. 183-191
Sommaire du
Fascicule no. 4
Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees
Susanne Hambrusch
;
Chuan-Ming Liu
;
Hyeong-Seok Lim
p. 1-26