rent-now

Rent More, Save More! Use code: ECRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

9783540669043

Graph Drawing: 7th International Symposium, Gd'99, Stirin Castle, Czech Republic, September 15-19, 1999 : Proceedings

by ;
  • ISBN13:

    9783540669043

  • ISBN10:

    3540669043

  • Format: Paperback
  • Copyright: 2000-01-01
  • Publisher: Springer Verlag
  • Purchase Benefits
List Price: $119.00 Save up to $99.20
  • Digital
    $42.90*
    Add to Cart

    DURATION
    PRICE
    *To support the delivery of the digital material to you, a digital delivery fee of $3.99 will be charged on each digital item.

Summary

This book constitutes the thoroughly refereed post-proceedings of the 7th International Symposium on Graph Drawing, GD '99, held in Stirin Castle, Czech Republic, in September 1999.The 38 revised full papers presented together with three invited contributions, two posters, and a report on the graph drawing contest were carefully reviewed and selected from 59 submissions. Among the topics addressed are orthogonality, levels, clusters, drawing, planarity, applications, symmetry, representations, and proximity and trees.

Table of Contents

Invited Talk
The Anatomy of a Geometric Algorithm
1(7)
Jiri Matousek
Orthogonality I
Turn-Regularity and Planar Orthogonal Drawings
8(19)
Stina S. Bridgeman
Roberto Tamassia
Luca Vismara
Giuseppe Di Battista
Walter Didimo
Giuseppe Liotta
Combining Graph Labeling and Compaction
27(11)
Gunnar W. Klau
Petra Mutzel
Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time
38(11)
Ashim Garg
Giuseppe Liotta
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing
49(10)
M. Closson
S. Gartshore
J. Johansen
S. K. Wismath
Levels I
An E log E Line Crossing Algorithm for Levelled Graphs
59(13)
Vance Waddle
Ashok Malhotra
Level Planar Embedding in Linear Time
72(10)
Michael Junger
Sebastian Leipert
Higres - Visualization System for Clustered Graphs and Graph Algorithms
82(8)
Ivan A. Lisitsyn
Victor N. Kasyanov
Clusters I
Partitioning Approach to Visualization of Large Graphs
90(8)
Vladimir Batagelj
Andrej Mrvar
Matjaz Zaversnik
Graph Clustering Using Distance-k Cliques
98(9)
Jubin Edachery
Arunabha Sen
Franz J. Brandernburg
Drawing I
A Framework for Circular Drawings of Networks
107(10)
Janet M. Six
Ioannis G. Tollis
Drawing Planar Graphs with Circular Arcs
117(10)
C. C. Cheng
C. A. Duncan
M. T. Goodrich
S. G. Kobourov
Drawing Graphs in the Hyperbolic Plane
127(10)
Bojan Mohar
Invited Talk
Graph Planarity and Related Topics
137(8)
Robin Thomas
Planarity
Grid Drawings of Four-Connected Plane Graphs
145(10)
Kazuyuki Miura
Takao Nishizeki
Shin-ichi Nakano
Graph Embedding with Topological Cycle-Constraints
155(10)
Christoph Dornheim
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
165(10)
Michael Kaufmann
Roland Wiese
The Constrained Crossing Minimization Problem
175(11)
Petra Mutzel
Thomas Ziegler
Clusters II
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
186(11)
Christian A. Duncan
Michael T. Goodrich
Stephen G. Kobourov
An Algorithm for Drawing Compound Graphs
197(8)
Francois Bertault
Mirka Miller
Levels II
The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation
205(12)
Patrick Healy
Ago Kuusik
Using Sifting for k-Layer Straightline Crossing Minimization
217(8)
Christian Matuszewski
Robby Schonfeld
Paul Molitor
On 3-Layer Crossings and Pseudo Arrangements
225(7)
Farhad Shahrokhi
Imrich Vrfo
Applications
Visualizing Algorithms for the Design and Analysis of Survivable Networks
232(10)
Ala Eddine Barouni
Ali Jaoua
Nejib Zaguia
LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation
242(8)
Lila Behzadi
Centrality in Policy Network Drawings
250(9)
Ulrik Brandes
Dorothea Wagner
Patrick Kenis
Straight-Line Drawings of Protein Interactions
259(8)
Wojciech Basalaj
Karen Eilbeck
Invited Talk
Art of Drawing
267(9)
Jaroslav Nesetril
Symmetry
An Heuristic for Graph Symmetry Detection
276(10)
Hubert de Fraysseix
Isomorphic Subgraphs
286(11)
Sabine Bachl
Orthogonality II
Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size
297(14)
G. Di Battista
W. Didimo
M. Patrignani
M. Pizzonia
Multi-dimensional Orthogonal Graph Drawing with Small Boxes
311(12)
David R. Wood
Representations
Geometric Realization of Simplicial Complexes
323(10)
Patrice Ossona de Mendez
Visibility Representations of Complete Graphs
333(8)
Robert Babilon
Helena Nyklova
Ondrej Pangrac
Jan Vondrak
Triangle-Free Planar Graphs as Segments Intersection Graphs
341(10)
N. de Castro
F. J. Cobos
J. C. Dana
A. Marquez
Marc Noy
Drawing II
A Force-Directed Algorithm that Preserves Edge Crossing Properties
351(8)
Francois Bertault
Proximity and Trees
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles
359(10)
Therese Biedl
Anna Bretscher
Henk Meijer
Voronoi Drawings of Trees
369(10)
Giuseppe Liotta
Henk Meijer
Infinite Trees and the Future
379(13)
C. Demetrescu
Irene Finocchi
Giuseppe Di Battista
Maurizio Patrignani
Maurizio Pizzonia
Giuseppe Liotta
Latour --- A Tree Visualisation System
392(8)
Ivan Herman
Guy Melancon
Maurice M de Ruiter
Maylis Delest
Graph Drawing Contest
Graph-Drawing Contest Report
400(10)
Franz J. Brandenburg
Falk Schreiber
Michael Junger
Joe Marks
Petra Mutzel
Hunting Down Graph B
410(6)
Ulrik Brandes
Posters
Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations
416(2)
Ho-Lin Chen
Hsu-Chun Yen
Electronic Biochemical Pathways
418(3)
Carl-Christian Kanne
Falk Schreiber
Dietrich Trumbach
Author Index 421

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program