000 06026nam a22005895i 4500
001 978-3-540-49155-2
003 DE-He213
005 20160624102040.0
007 cr nn 008mamaa
008 121227s1995 gw | s |||| 0|eng d
020 _a9783540491552
_9978-3-540-49155-2
024 7 _a10.1007/3-540-58950-3
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aGraph Drawing
_h[electronic resource] :
_bDIMACS International Workshop, GD '94 Princeton, New Jersey, USA, October 10–12, 1994 Proceedings /
_cedited by Roberto Tamassia, Ioannis G. Tollis.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1995.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1995.
300 _aCDLXXXVIII, 478 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 ;
_v894
505 0 _aThree-dimensional graph drawing -- 3-D visualization of program information (extended abstract and system demonstration) -- 3D layout of reachability graphs of communicating processes -- A flow approach to upward drawings of toroidal maps -- Improved algorithms and bounds for orthogonal drawings -- On bend-minimum orthogonal upward drawing of directed planar graphs -- Grid layouts of block diagrams — bounding the number of bends in each connection (extended abstract) -- On drawing a graph convexly in the plane (extended abstract) -- On drawing angle graphs -- Regular edge labelings and drawings of planar graphs -- Minimum-width grid drawings of plane graphs extend abstract -- Regular orientations, arboricity, and augmentation -- The polyhedral approach to the maximum planar subgraph problem: New chances for related problems -- Crossing numbers of graphs, lower bound techniques and algorithms: A survey -- Graph-drawing contest report -- Visibility graphs and oriented matroids (extended abstract) -- Rectangle-visibility representations of bipartite graphs -- On the number of directions in visibility representations of graphs (extended abstract) -- Directed VR-representable graphs have unbounded dimension -- GraphEd: A graphical platform for the implementation of graph algorithms (extended abstract and demo) -- Graph layout through the VCG tool -- Drawing telecommunication networks -- Reduction of visual complexity in dynamic graphs -- TOSCANA — A graphical tool for analyzing and exploring data -- Characterization and recognition of point-halfspace and related orders -- Redrawing a graph within a geometric tolerance -- On the difficulty of embedding planar graphs with inaccuracies -- A system for drawing graphs with geometric symmetry -- Demonstration of the interactive graph visualization system da Vinci -- CG: A graph drawing system using graph-grammar parsing -- A demonstration of interactive graph based visual language applications -- A simple algorithm for drawing large graphs on small screens -- Molecular graph eigenvectors for molecular coordinates -- On the computational complexity of upward and rectilinear planarity testing -- Upward planarity testing of outerplanar dags (extended abstract) -- Optimal-area upward drawings of AVL trees -- Upward drawing on the plane grid using less ink -- Proximity drawability: A survey extended abstract -- Proximity constraints and representable trees (extended abstract) -- Recognizing rectangle of influence drawable graphs (extended abstract) -- A simple and unified method for drawing graphs: Magnetic-spring algorithm -- Integration of declarative and algorithmic approaches for layout creation -- A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration) -- Drawing graphs by example efficiently: Trees and planar acyclic digraphs (extended abstract) -- Designing graph drawings by layout graph grammars -- Encoding presentation emphasis algorithms for graphs -- A practical approach to static node positioning -- Map generalization as a graph drawing problem -- A geometrical heuristic for drawing concept lattices -- Poster gallery report.
520 _aThis volume constitutes the proceedings of the DIMACS International Workshop on Graph Drawing, GD '94, held in Princeton, New Jersey in October 1994. The 50 papers and system descriptions presented address the problem of constructing geometric representations of abstract graphs, networks and hypergraphs, with applications to key technologies such as software engineering, databases, visual interfaces, and circuit layout; they are organized in sections on three-dimensional drawings, orthogonal drawings, planar drawings, crossings, applications and systems, geometry, system demonstrations, upward drawings, proximity drawings, declarative and other approaches; in addition reports on a graph drawing contest and a poster gallery are included.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aComputer software.
650 0 _aComputer graphics.
650 0 _aComputer aided design.
650 0 _aCombinatorics.
650 0 _aElectronics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aCombinatorics.
650 2 4 _aSoftware Engineering.
650 2 4 _aComputer Graphics.
650 2 4 _aComputer-Aided Engineering (CAD, CAE) and Design.
650 2 4 _aElectronics and Microelectronics, Instrumentation.
700 1 _aTamassia, Roberto.
_eeditor.
700 1 _aTollis, Ioannis G.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540589501
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v894
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-58950-3
942 _2EBK6678
_cEBK
999 _c35972
_d35972