LEADER 06971nam 22008055 450 001 9910143605703321 005 20200704045935.0 010 $a3-540-44541-2 024 7 $a10.1007/3-540-44541-2 035 $a(CKB)1000000000211398 035 $a(SSID)ssj0000323587 035 $a(PQKBManifestationID)11247952 035 $a(PQKBTitleCode)TC0000323587 035 $a(PQKBWorkID)10303821 035 $a(PQKB)10662661 035 $a(DE-He213)978-3-540-44541-8 035 $a(MiAaPQ)EBC3072031 035 $a(PPN)155232479 035 $a(EXLCZ)991000000000211398 100 $a20121227d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aGraph Drawing $e8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings /$fedited by Joe Marks 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (XII, 422 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1984 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-41554-8 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talk -- The Visual Representation of Information Structures -- Empirical Studies and Standards -- User Preference of Graph Layout Aesthetics: A UML Study -- A User Study in Similarity Measures for Graph Drawing -- Interactive Partitioning System Demonstration, Short -- An Experimental Comparison of Orthogonal Compaction Algorithms -- GraphXML ? An XML-Based Graph Description Format -- Theory I -- On Polar Visibility Representations of Graphs -- A Linear Time Implementation of SPQR-Trees -- Labeling Points with Rectangles of Various Shapes -- How to Draw the Minimum Cuts of a Planar Graph -- Applications and Systems -- 2D-Structure Drawings of Similar Molecules -- Fast Layout Methods for Timetable Graphs -- An Algorithmic Framework for Visualizing Statecharts -- Visualization of the Autonomous Systems Interconnections with Hermes -- Drawing Hypergraphs in the Subset Standard (Short Demo Paper) -- Invited Talk -- Knowledge Discovery from Graphs -- Force-Directed Layout -- A Multilevel Algorithm for Force-Directed Graph Drawing -- A Fast Multi-scale Method for Drawing Large Graphs -- FADE: Graph Drawing, Clustering, and Visual Abstraction -- A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs -- GRIP: Graph dRawing with Intelligent Placement -- k-Level Graph Layout -- A Fast Layout Algorithm for k-Level Graphs -- Graph Layout for Displaying Data Structures -- k-Layer Straightline Crossing Minimization by Speeding Up Sifting -- Orthogonal Drawing I -- Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings -- Orthogonal Drawings of Cycles in 3D Space -- Three-Dimensional Orthogonal Graph Drawing with Optimal Volume -- Orthogonal Drawing II -- A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs -- Refinement of Three-Dimensional Orthogonal Graph Drawings -- Theory II -- ?-Searchlight Obedient Graph Drawings -- Unavoidable Configurations in Complete Topological Graphs -- Minimum Weight Drawings of Maximal Triangulations -- A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band -- Symmetry and Incremental Layout -- An Algorithm for Finding Three Dimensional Symmetry in Trees -- On Maximum Symmetric Subgraphs -- Clan-Based Incremental Drawing -- The Marey Graph Animation Tool Demo -- Workshop and Contest -- Graph Data Format Workshop Report -- Graph-Drawing Contest Report. 330 $aThis year?s meeting marked the Eighth International Symposium on Graph D- wing. The organizing and program committees worked hard to make this year?s symposium possible, and we were delighted that so many people came to - lonial Williamsburg, Virginia, for three days of the latest results in the eld of graph drawing. As in previous years, the review process was quite competitive. We accepted 30 out of 53 regular-length submissions, and 5 out of 15 short submissions, for a total acceptance ratio of 35 out of 68, or 51%. This year?s program featured several new developments in the eld. Four di erent approaches for handling very large graphs were presented in a session on force-directed layout. Two sessions were devoted to the latest advances in orthogonal graph drawing. And alongside the usual mix of theory and practice papers we had several contributions based on empirical studies of users and of systems. Our invited talks were given by two speakers who were new to most members of the GD community, but who work in areas that are closely related to graph drawing. Professor Colin Ware of the University of New Hampshire told us how knowledge of human visual perception is useful for the design of e ective data visualizations. And Professor David Jensen of the University of Massachusetts at Amherst talked about the process of knowledge discovery from graphs, a process that involves more than just graph drawing and visualization. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1984 606 $aAlgorithms 606 $aDiscrete mathematics 606 $aComputers 606 $aComputer graphics 606 $aComputer science?Mathematics 606 $aCombinatorial analysis 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputer Graphics$3https://scigraph.springernature.com/ontologies/product-market-codes/I22013 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aAlgorithms. 615 0$aDiscrete mathematics. 615 0$aComputers. 615 0$aComputer graphics. 615 0$aComputer science?Mathematics. 615 0$aCombinatorial analysis. 615 14$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics. 615 24$aTheory of Computation. 615 24$aComputer Graphics. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aCombinatorics. 676 $a511.5 702 $aMarks$b Joe$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aSymposium on Graph Drawing 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143605703321 996 $aGraph Drawing$9773153 997 $aUNINA