000 05094nam a22005775i 4500
001 978-3-540-69674-2
003 DE-He213
005 20160624102059.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540696742
_9978-3-540-69674-2
024 7 _a10.1007/3-540-63938-1
_2doi
050 4 _aQA76.9.M35 
072 7 _aPBD
_2bicssc
072 7 _aUYAM
_2bicssc
072 7 _aCOM018000
_2bisacsh
072 7 _aMAT008000
_2bisacsh
082 0 4 _a004.0151
_223
245 1 0 _aGraph Drawing
_h[electronic resource] :
_b5th International Symposium, GD '97 Rome, Italy, September 18–20, 1997 Proceedings /
_cedited by Giuseppe DiBattista.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
300 _aXII, 456 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,
_x0302-9743 ;
_v1353
505 0 _aDrawable and forbidden minimum weight triangulations -- A polyhedral approach to the multi-layer crossing minimization problem -- On embedding an outer-planar graph in a point set -- Bipartite crossing numbers of meshes and hypercubes -- Three-dimensional grid drawings of graphs -- Incremental orthogonal graph drawing in three dimensions -- On three-dimensional layout of interconnection networks -- Orthogonal 3-D graph drawing -- Finding the best viewpoints for three-dimensional graph drawings -- A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs -- Interactive orthogonal graph drawing: Algorithms and bounds -- Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard -- Algorithms and area bounds for nonplanar orthogonal drawings -- Drawing clustered graphs on an orthogonal grid -- Graph clustering I: Cycles of cliques -- An algorithm for labeling edges of hierarchical drawings -- Elastic labels: The two-axis case -- Pitfalls of using PQ-trees in automatic graph drawing -- Graph drawing with no k pairwise crossing edges -- Area requirements for drawing hierarchically planar graphs -- A short proof of a Gauss problem -- A bayesian paradigm for dynamic graph layout -- Which aesthetic has the greatest effect on human understanding? -- Implementing a general-purpose edge router -- The wobbly logic engine: Proving hardness of non-rigid geometric graph representation problems -- 3DCube: A tool for three dimensional graph drawing -- Graph clustering using multiway ratio cut (Software demonstration) -- ArchE: A graph drawing system for archaeology -- InteractiveGiotto: An algorithm for interactive orthogonal graph drawing -- GRID: An interactive tool for computing orthogonal drawings with the minimum number of bends -- Lexical navigation: Using incremental graph drawing for query refinement -- Design gallery browsers based on 2D and 3D graph drawing (Demo) -- Online animated graph drawing for web navigation -- Grappa: A graph package in java -- GraVis — System demonstration -- Touching graphs of unit balls -- Discrete realizations of contact and intersection graphs (extended abstract) -- Minimum-area h-v drawings of complete binary trees -- Packing trees into planar graphs -- The three-phase method: A unified approach to orthogonal graph drawing -- NicheWorks — Interactive visualization of very large graphs -- Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams -- Graph drawing and manipulation with LINK -- Graph-drawing contest report.
520 _aThis book constitutes the strictly refereed post-conference proceedings of the 5th International Symposium on Graph Drawing, GD'97, held in Rome, Italy, in September 1997. The 33 revised full papers and 10 systems demonstrations presented were selected from 80 submissions. The topics covered include planarity, crossing theory, three dimensional representations, orthogonal representations, clustering and labeling problems, packing problems, general methodologies, and systems and applications.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aComputer graphics.
650 0 _aVisualization.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aCombinatorics.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputer Graphics.
650 2 4 _aVisualization.
700 1 _aDiBattista, Giuseppe.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540639381
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1353
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-63938-1
942 _2EBK7319
_cEBK
999 _c36613
_d36613