Graph Drawing: Symposium on Graph Drawing GD'96, Berkeley, California, USA, September 18 - 20, 1996, Proceedings by North, StephenGraph Drawing: Symposium on Graph Drawing GD'96, Berkeley, California, USA, September 18 - 20, 1996, Proceedings by North, Stephen

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

EditorNorth, Stephen

Paperback | January 15, 1997

Pricing and Purchase Info

$145.34 online 
$154.95 list price save 6%
Earn 727 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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 of 50 papers and 24 demos submitted. Also included is a summary of the annual graph drawing competition. Among the topics covered are planarity, upward and orthogonal drawing, heuristics, experimental results, and graph drawing systems.
Title:Graph Drawing: Symposium on Graph Drawing GD'96, Berkeley, California, USA, September 18 - 20, 1996…Format:PaperbackDimensions:420 pagesPublished:January 15, 1997Publisher:Springer Berlin Heidelberg

The following ISBNs are associated with this title:

ISBN - 10:3540624953

ISBN - 13:9783540624950

Look for similar items by category:

Reviews

Table of Contents

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.