# Graph drawing : 7th international symposium, GD'99, Štiřín Castle, Czech Republic, September 15-19, 1999 : proceedings / Jan Kratochvíl (ed.).

##### Contributor(s): Kratochvíl, Jan | GD (Symposium) (7th : 1999 : Štiřín Castle, Czech Republic)

Material type: TextSeries: SerienbezeichnungLecture notes in computer science: 1731.Publisher: Berlin ; New York : Springer, ©1999Description: 1 online resource (xiii, 422 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540466482; 3540466487Subject(s): Computer graphics -- Congresses | Graph theory -- Congresses | Computer graphics | Graph theory | ComputergraphicsGenre/Form: Electronic books. | Conference papers and proceedings. | Congressen (vorm) | Electronic books. Additional physical formats: Print version:: Graph drawing.DDC classification: 511/.5 LOC classification: T385 | .G69344 1999Other classification: 54.73 Online resources: Click here to access onlineItem type | Current location | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|

eBook |
e-Library
Electronic Book@IST |
EBook | Available |

Includes bibliographical references and index.

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.

Invited Talk -- The Anatomy of a Geometric Algorithm -- Orthogonality I -- Turn-Regularity and Planar Orthogonal Drawings -- Combining Graph Labeling and Compaction -- Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time -- Fully Dynamic 3-Dimensional Orthogonal Graph Drawing -- Levels I -- An E log E Line Crossing Algorithm for Levelled Graphs -- Level Planar Embedding in Linear Time -- Higres -- Visualization System for Clustered Graphs and Graph Algorithms -- Clusters I -- Partitioning Approach to Visualization of Large Graphs -- Graph Clustering Using Distance-k Cliques -- Drawing I -- A Framework for Circular Drawings of Networks -- Drawing Planar Graphs with Circular Arcs -- Drawing Graphs in the Hyperbolic Plane -- Invited Talk -- Graph Planarity and Related Topics -- Planarity -- Grid Drawings of Four-Connected Plane Graphs -- Graph Embedding with Topological Cycle-Constraints -- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs -- The Constrained Crossing Minimization Problem -- Clusters II -- Planarity-Preserving Clustering and Embedding for Large Planar Graphs -- An Algorithm for Drawing Compound Graphs -- Levels II -- The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation -- Using Sifting for k-Layer Straightline Crossing Minimization -- On 3-Layer Crossings and Pseudo Arrangements -- Applications -- Visualizing Algorithms for the Design and Analysis of Survivable Networks -- LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation -- Centrality in Policy Network Drawings -- Straight-Line Drawings of Protein Interactions -- Invited Talk -- Art of Drawing -- Symmetry -- An Heuristic for Graph Symmetry Detection -- Isomorphic Subgraphs -- Orthogonality II -- Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size -- Multi-dimensional Orthogonal Graph Drawing with Small Boxes -- Representations -- Geometric Realization of Simplicial Complexes -- Visibility Representations of Complete Graphs -- Triangle-Free Planar Graphs as Segments Intersection Graphs -- Drawing II -- A Force-Directed Algorithm that Preserves Edge Crossing Properties -- Proximity and Trees -- Rectangle of Influence Drawings of Graphs without Filled 3-Cycles -- Voronoi Drawings of Trees -- Infinite Trees and the Future -- Latour -- A Tree Visualisation System -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Hunting Down Graph B -- Posters -- Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations -- Electronic Biochemical Pathways.

There are no comments for this item.