Graph drawing : Symposium on Graph Drawing, GD '96, Berkeley, California, USA, September 18 20, 1996 : proceedings

This book constitutes the strictly refereed post-conference proceedings of the International Symposium on Graph Drawing, GD'96, held in Berkeley, California, in September 1996. The 24 revised full papers and the 8 systems demonstrations presented in the book were carefully selected from a total...

Description complète

Enregistré dans:
Détails bibliographiques
Collectivité auteur: Symposium on Graph Drawing :Berkeley, Calif.
Autres auteurs: North, Stephen C. (Directeur de la publication)
Format: Livre numérique
Langue:Anglais
Publié: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Collection:Lecture notes in computer science 1190
Sujets:
Accès en ligne:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Note: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Graph drawing, Symposium on Graph Drawing, GD '96, Berkely, California, USA, September 18-20, 1996, proceedings, Stephen North (ed.), 1997, New York, Springer, 1 vol. (XI-408 p.), Lecture notes in computer science, 3-540-62495-3
• Graph Drawing, Texte imprimé, 9783662185216
Table des matières:
  • Bipartite embeddings of trees in the plane
  • Series-parallel planar ordered sets have pagenumber two
  • On rectangle visibility graphs
  • A graph drawing and translation service on the WWW
  • Drawing 2-, 3- and 4-colorable graphs in O(n2) volume
  • Optimizing area and aspect ratio in straight-line orthogonal tree drawings
  • Drawing directed acyclic graphs: An experimental study
  • Circular layout in the Graph Layout toolkit
  • Multilevel visualization of clustered graphs
  • Straight-line drawing algorithms for hierarchical graphs and clustered graphs
  • Graph-Drawing contest report
  • Two algorithms for three dimensional orthogonal graph drawing
  • 2-Visibility drawings of planar graphs
  • Upper bounds on the number of hidden nodes in Sugiyama's algorithm
  • Integration of declarative approaches (System Demonstration)
  • GIOTTO3D: A system for visualizing hierarchical structures in 3D
  • A new minimum cost flow algorithm with applications to graph drawing
  • Constrained graph layout
  • The graphlet system (system demonstration)
  • On the Edge Label Placement problem
  • Intersection graphs of noncrossing arc-connected sets in the plane
  • Wiring edge-disjoint layouts
  • Proximity drawings of outerplanar graphs (extended abstract)
  • Automatic visualization of two-dimensional cellular complexes
  • An alternative method to crossing minimization on hierarchical graphs
  • A linear-time algorithm for four-partitioning four-connected planar graphs
  • Graphs drawn with few crossings per edge
  • A pairing technique for area-efficient orthogonal drawings (extended abstract)
  • Experimental and theoretical results in interactive orthogonal graph drawing
  • An interactive system for drawing graphs
  • Automatic graph clustering (system demonstration)
  • Qualitative visualization of processes: Attributed graph layout and focusing techniques.