國立虎尾科技大學 |

Graph Drawing and Network Visualization = 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020, Revised Selected Papers /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Graph Drawing and Network Visualization/ edited by David Auber, Pavel Valtr.
其他題名:	28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020, Revised Selected Papers /
其他作者:	Valtr, Pavel.
面頁冊數:	XVII, 546 p. 259 illus., 195 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer Imaging, Vision, Pattern Recognition and Graphics. -
電子資源:	https://doi.org/10.1007/978-3-030-68766-3
ISBN:	9783030687663

Graph Drawing and Network Visualization = 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020, Revised Selected Papers /
Graph Drawing and Network Visualization28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020, Revised Selected Papers /[electronic resource] :edited by David Auber, Pavel Valtr. - 1st ed. 2020. - XVII, 546 p. 259 illus., 195 illus. in color.online resource. - Information Systems and Applications, incl. Internet/Web, and HCI ;12590. - Information Systems and Applications, incl. Internet/Web, and HCI ;9149.

Gradient descent and queue layouts -- Graph drawing via gradient descent (GD)² -- 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.

This 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.

ISBN: 9783030687663

Standard No.: 10.1007/978-3-030-68766-3doiSubjects--Topical Terms:

671334
Computer Imaging, Vision, Pattern Recognition and Graphics.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Graph Drawing and Network Visualization = 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020, Revised Selected Papers /
LDR:04854nam a22004335i 4500 001 1031344
003 DE-He213
005 20210213183934.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030687663 $9 978-3-030-68766-3
024 7 $a 10.1007/978-3-030-68766-3 $2 doi
035 $a 978-3-030-68766-3
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
245 1 0 $a Graph Drawing and Network Visualization $h [electronic resource] : $b 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16–18, 2020, Revised Selected Papers / $c edited by David Auber, Pavel Valtr.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XVII, 546 p. 259 illus., 195 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Information Systems and Applications, incl. Internet/Web, and HCI ; $v 12590
505 0 $a Gradient descent and queue layouts -- Graph drawing via gradient descent (GD)² -- 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.
520 $a This 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.
650 2 4 $a Computer Imaging, Vision, Pattern Recognition and Graphics. $3 671334
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a User Interfaces and Human Computer Interaction. $3 669793
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Optical data processing. $3 639187
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a User interfaces (Computer systems). $3 1253526
650 0 $a Computers. $3 565115
700 1 $a Valtr, Pavel. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1328459
700 1 $a Auber, David. $e editor. $1 https://orcid.org/0000-0002-1114-8612 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1328458
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030687656
776 0 8 $i Printed edition: $z 9783030687670
830 0 $a Information Systems and Applications, incl. Internet/Web, and HCI ; $v 9149 $3 1253558
856 4 0 $u https://doi.org/10.1007/978-3-030-68766-3
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)