Skip to main content
SpringerLink
Log in

Graph Drawing

5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997. Proceedings

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Giuseppe DiBattista
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1353)

Included in the following conference series:

Conference proceedings info: GD 1997.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (44 papers)

  1. Front Matter

    Download chapter PDF

  2. Drawable and forbidden minimum weight triangulations

    • William Lenhart, Giuseppe Liotta
    Pages 1-12

  3. A polyhedral approach to the multi-layer crossing minimization problem

    • Michael Jünger, Eva K. Lee, Petra Mutzel, Thomas Odenthal
    Pages 13-24

  4. On embedding an outer-planar graph in a point set

    • Prosenjit Bose
    Pages 25-36

  5. Bipartite crossing numbers of meshes and hypercubes

    • Farhad Shahrokhi, Ondrej Sykora, László A. Székely, Imrich Vrt'o
    Pages 37-46

  6. Three-dimensional grid drawings of graphs

    • János Pach, Torsten Thiele, Géza Tóth
    Pages 47-51

  7. Incremental orthogonal graph drawing in three dimensions

    • Achilleas Papakostas, Ioannis G. Tollis
    Pages 52-63

  8. On three-dimensional layout of interconnection networks

    • Tiziana Calamoneri, Annalisa Massini
    Pages 64-75

  9. Orthogonal 3-D graph drawing

    • T. Biedl, T. Shermer, S. Whitesides, S. Wismath
    Pages 76-86

  10. Finding the best viewpoints for three-dimensional graph drawings

    • Peter Eades, Michael E. Houle, Richard Webber
    Pages 87-98

  11. A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs

    • Md. Saidur Rahman, Shin-ichi Nakano, Takao Nishizeki
    Pages 99-110

  12. Interactive orthogonal graph drawing: Algorithms and bounds

    • Ulrich Fößmeier
    Pages 111-123

  13. Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard

    • M. A. Garrido, A. Márquez
    Pages 124-133

  14. Algorithms and area bounds for nonplanar orthogonal drawings

    • Ulrich Föβmeier, Michael Kaufmann
    Pages 134-145

  15. Drawing clustered graphs on an orthogonal grid

    • Peter Eades, Qing-Wen Feng
    Pages 146-157

  16. Graph clustering I: Cycles of cliques

    • F. J. Brandenburg
    Pages 158-168

  17. An algorithm for labeling edges of hierarchical drawings

    • Konstantinos G. Kakoulis, Ioannis G. Tollis
    Pages 169-180

  18. Elastic labels: The two-axis case

    • Claudia Iturriaga, Anna Lubiw
    Pages 181-192

  19. Pitfalls of using PQ-trees in automatic graph drawing

    • Michael Jünger, Sebastian Leipert, Petra Mutzel
    Pages 193-204

  20. Graph drawing with no k pairwise crossing edges

    • Pavel Valtr
    Pages 205-218
Back to top

Other volumes

  1. Graph Drawing

Keywords

About this book

This book constitutes the strictly refereed post-conference proceedings of the 5th International Symposium on Graph Drawing, GD'97, held in Rome, Italy, in September 1997. The 33 revised full papers and 10 systems demonstrations presented were selected from 80 submissions. The topics covered include planarity, crossing theory, three dimensional representations, orthogonal representations, clustering and labeling problems, packing problems, general methodologies, and systems and applications.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation