000959668 000__ 05225cam\a2200505Ii\4500
000959668 001__ 959668
000959668 005__ 20230306152656.0
000959668 006__ m\\\\\o\\d\\\\\\\\
000959668 007__ cr\cn\nnnunnun
000959668 008__ 210220s2021\\\\sz\\\\\\o\\\\\101\0\eng\d
000959668 020__ $$a9783030687663$$q(electronic bk.)
000959668 020__ $$a303068766X$$q(electronic bk.)
000959668 020__ $$z9783030687656
000959668 0247_ $$a10.1007/978-3-030-68766-3$$2doi
000959668 035__ $$aSP(OCoLC)on1237863458
000959668 035__ $$aSP(OCoLC)1237863458
000959668 040__ $$aEBLCP$$beng$$erda$$cEBLCP$$dGW5XE$$dOCLCO
000959668 049__ $$aISEA
000959668 050_4 $$aQA76.9.A43
000959668 08204 $$a004.01/51$$223
000959668 1112_ $$aGD (Symposium)$$n(28th :$$d2020 :$$cOnline)
000959668 24510 $$aGraph drawing and network visualization :$$b28th international symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020 : revised selected papers /$$cDavid Auber, Pavel Valtr (eds.).
000959668 24630 $$aGD 2020
000959668 264_1 $$aCham :$$bSpringer,$$c[2021]
000959668 300__ $$a1 online resource (549 pages).
000959668 336__ $$atext$$btxt$$2rdacontent
000959668 337__ $$acomputer$$bc$$2rdamedia
000959668 338__ $$aonline resource$$bcr$$2rdacarrier
000959668 4901_ $$aLecture notes in computer science ;$$v12590
000959668 500__ $$aInternational conference proceedings.
000959668 5050_ $$aGradient descent and queue layouts -- Graph drawing via gradient descent (GD)p2s -- Stochastic Gradient Descent Works Really Well for Stress Minimization -- The Local Queue Number of Graphs with Bounded Treewidth -- Parameterized Algorithms for Queue Layouts -- Lazy Queue Layouts of Posets -- Drawing tree-like graphs, visualisation, and special drawings of elementary graphs Improved Upper and Lower Bounds for LR Drawings of Binary Trees -- On the Edge-Length Ratio of 2-Trees -- HOTVis: Higher-Order Time-Aware Visualisation of Dynamic Graphs -- VAIM: Visual Analytics for Influence Maximization -- Odd wheels are not odd-distance graphs -- Polygons with Prescribed Angles in 2D and 3D -- Restricted drawings of special graph classes On Mixed Linear Layouts of Series-Parallel Graphs -- Schematic Representation of Large Biconnected Graphs -- Drawing Tree-Based Phylogenetic Networks with Minimum Number of Crossings -- A Tipping Point for the Planarity of Small and Medium Sized Graphs -- Orthogonality -- Characterization and a 2D Visualization of B0-VPG Cocomparability Graphs -- Planar L-Drawings of Bimodal Graphs -- Layered Drawing of Undirected Graphs with Generalized Port Constraints -- An Integer-Linear Program for Bend-Minimization in Ortho-Radial Drawings -- On Turn-Regular Orthogonal Representations -- Extending Partial Orthogonal Drawings -- Topological constraints -- Topological Drawings meet Classical Theorems from Convex Geometry -- Towards a characterization of stretchable aligned graphs -- Exploring the Design Space of Aesthetics with the Repertory Grid Technique -- Storyline Visualizations with Ubiquitous Actors -- Drawing Shortest Paths in Geodetic Graphs -- Limiting Crossing Numbers for Geodesic Drawings on the Sphere -- Crossings, k-planar graphs -- Crossings between non-homotopic edges -- Improvement on the crossing number of crossing-critical graphs -- On the Maximum Number of Crossings in Star-Simple Drawings of K n with No Empty Lens -- Simple Topological Drawings of k-Planar Graphs -- 2-Layer k-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth -- Planarity -- Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time -- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time -- New Quality Metrics for Dynamic Graph Drawing -- The Turing Test for Graph Drawing Algorithms -- Plane Spanning Trees in Edge-Colored Simple Drawings of Kn -- Augmenting Geometric Graphs with Matchings -- Graph Drawing Contest -- Graph Drawing Contest Report.
000959668 506__ $$aAccess limited to authorized users.
000959668 520__ $$aThis book constitutes the refereed proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, GD 2020, which was held during September 16-18, 2020. The conference was planned to take place in Vancouver, Canada, but changed to an online format due to the COVID-19 pandemic. The 29 full and 9 short papers presented in this volume were carefully reviewed and selected from 82 submissions. They were organized in topical sections named: gradient descent and queue layouts; drawing tree-like graphs, visualization, and special drawings of elementary graphs; restricted drawings of special graph classes; orthogonality; topological constraints; crossings, k-planar graphs; planarity; graphs drawing contest.
000959668 588__ $$aDescription based upon print version of record.
000959668 650_0 $$aGraph theory$$xData processing$$vCongresses.
000959668 650_0 $$aComputer graphics$$vCongresses.
000959668 655_0 $$aElectronic books.
000959668 7001_ $$aAuber, David,$$eeditor.
000959668 7001_ $$aValtr, Pavel,$$eeditor.
000959668 77608 $$iPrint version:$$aAuber, David$$tGraph Drawing and Network Visualization$$dCham : Springer International Publishing AG,c2021$$z9783030687656
000959668 830_0 $$aLecture notes in computer science ;$$v12590.
000959668 852__ $$bebk
000959668 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-68766-3$$zOnline Access$$91397441.1
000959668 909CO $$ooai:library.usi.edu:959668$$pGLOBAL_SET
000959668 980__ $$aEBOOK
000959668 980__ $$aBIB
000959668 982__ $$aEbook
000959668 983__ $$aOnline
000959668 994__ $$a92$$bISE