000 04603nam a22006375i 4500
001 978-3-540-68048-2
003 DE-He213
005 20240423132543.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540680482
_9978-3-540-68048-2
024 7 _a10.1007/3-540-62495-3
_2doi
050 4 _aQA76.9.M35
050 4 _aQA297.4
072 7 _aUYAM
_2bicssc
072 7 _aPBD
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYAM
_2thema
072 7 _aPBD
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aGraph Drawing
_h[electronic resource] :
_bSymposium on Graph Drawing GD'96, Berkeley, California, USA, September 18 - 20, 1996, Proceedings /
_cedited by Stephen North.
250 _a1st ed. 1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1997.
300 _aXIII, 415 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1190
505 0 _aBipartite 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.
520 _aThis 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.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aComputer-aided engineering.
650 0 _aAlgorithms.
650 0 _aComputer graphics.
650 1 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer-Aided Engineering (CAD, CAE) and Design.
650 2 4 _aDiscrete Mathematics.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Graphics.
700 1 _aNorth, Stephen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540624950
776 0 8 _iPrinted edition:
_z9783662185216
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1190
856 4 0 _uhttps://doi.org/10.1007/3-540-62495-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189047
_d189047