04472nam a22006135i 4500
978-3-540-68048-2
DE-He213
20170515111447.0
cr nn 008mamaa
121227s1997 gw | s |||| 0|eng d
9783540680482
978-3-540-68048-2
10.1007/3-540-62495-3
doi
QA76.9.M35
PBD
bicssc
UYAM
bicssc
COM018000
bisacsh
MAT008000
bisacsh
004.0151
23
Graph Drawing
[electronic resource] :
Symposium on Graph Drawing, GD '96 Berkeley, California, USA, September 18–20, 1996 Proceedings /
edited by Stephen North.
Berlin, Heidelberg :
Springer Berlin Heidelberg,
1997.
XIII, 415 p.
online resource.
text
txt
rdacontent
computer
c
rdamedia
online resource
cr
rdacarrier
text file
PDF
rda
Lecture Notes in Computer Science,
0302-9743 ;
1190
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.
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.
Computer science.
Algorithms.
Computer science
Mathematics.
Computer graphics.
Computer-aided engineering.
Discrete mathematics.
Combinatorics.
Computer Science.
Discrete Mathematics in Computer Science.
Computer-Aided Engineering (CAD, CAE) and Design.
Discrete Mathematics.
Algorithm Analysis and Problem Complexity.
Computer Graphics.
Combinatorics.
North, Stephen.
editor.
SpringerLink (Online service)
Springer eBooks
Printed edition:
9783540624950
Lecture Notes in Computer Science,
0302-9743 ;
1190
http://dx.doi.org/10.1007/3-540-62495-3
ZDB-2-SCS
ZDB-2-LNC
ZDB-2-BAE
ddc
EB
Computer Science (Springer-11645)
14269
14269