國立虎尾科技大學 |

Graph Drawing and Network Visualization = 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings /

Record Type:	Language materials, printed : Monograph/item
Title/Author:	Graph Drawing and Network Visualization/ edited by Daniel Archambault, Csaba D. Tóth.
Reminder of title:	27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings /
other author:	Archambault, Daniel.
Description:	XXIII, 626 p. 460 illus., 244 illus. in color.online resource. :
Contained By:	Springer Nature eBook
Subject:	Algorithms. -
Online resource:	https://doi.org/10.1007/978-3-030-35802-0
ISBN:	9783030358020

Graph Drawing and Network Visualization = 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings /
Graph Drawing and Network Visualization27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings /[electronic resource] :edited by Daniel Archambault, Csaba D. Tóth. - 1st ed. 2019. - XXIII, 626 p. 460 illus., 244 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11904. - Theoretical Computer Science and General Issues ;9163.

Cartograms and Intersection Graphs -- Stick Graphs with Length Constraints -- Representing Graphs and Hypergraphs by Touching Polygons in 3D -- Optimal Morphs of Planar Orthogonal Drawings II -- Computing Stable Demers Cartograms -- Geometric Graph Theory -- Bundled Crossings Revisited -- Crossing Numbers of Beyond-Planar Graphs -- On the 2-Colored Crossing Number -- Minimal Representations of Order Types by Geometric Graphs -- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators -- Clustering -- A Quality Metric for Visualization of Clusters in Graphs -- Multi-level Graph Drawing using Infomap Clustering -- On Strict (Outer-)Conﬂuent Graphs -- Quality Metrics -- On the Edge-Length Ratio of Planar Graphs -- Node Overlap Removal Algorithms: A Comparative Study -- Graphs with large total angular resolution -- Arrangements -- Computing Height-Optimal Tangles Faster -- On Arrangements of Orthogonal Circles -- Extending Simple Drawings -- Coloring Hasse diagrams and disjointness graphs of curves -- A Low Number of Crossings -- Eﬃcient Generation of Diﬀerent Topological Representations of Graphs Beyond-Planarity -- The QuaSEFE Problem -- ChordLink: A New Hybrid Visualization Model -- Stress-Plus-X (SPX) Graph Layout -- Best Paper in Track 1 -- Exact Crossing Number Parameterized by Vertex Cover -- Morphing and Planarity -- Maximizing Ink in Partial Edge Drawings of k-Plane Graphs -- Graph Drawing with Morphing Partial Edges -- A Note on Universal Point Sets for Planar Graphs -- Parameterized Complexity -- Parameterized Algorithms for Book Embedding Problems -- Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs -- Collinearities -- 4-Connected Triangulations on Few Lines -- Line and Plane Cover Numbers Revisited -- Drawing planar graphs with few segments on a polynomial grid -- Variants of the Segment Number of a Graph -- Topological Graph Theory -- Local and Union Page Numbers -- Mixed Linear Layouts: Complexity, Heuristics, and Experiments -- Homotopy height, grid-major height and graph-drawing height -- On the Edge-Vertex Ratio of Maximal Thrackles -- Best Paper in Track 2 -- Symmetry Detection and Classiﬁcation in Drawings of Graphs -- Level Planarity -- An SPQR-Tree-Like Embedding Representation for Upward Planarity -- A Natural Quadratic Approach to the Generalized Graph Layering Problem -- Graph Stories in Small Area -- Level-Planar Drawings with Few Slopes -- Graph Drawing Contest Report -- Graph Drawing Contest Report -- Poster Abstracts -- A 1-planarity Testing and Embedding Algorithm -- Stretching Two Pseudolines in Planar Straight-Line Drawings -- Adventures in Abstraction: Reachability in Hierarchical Drawings -- On Topological Book Embedding for k-Plane Graphs -- On Compact RAC Drawings -- FPQ-choosable Planarity Testing -- Packing Trees into 1-Planar Graphs -- Geographic Network Visualization Techniques: A Work-In-Progress Taxonomy -- On the Simple Quasi Crossing Number of K 11 -- Minimising Crossings in a Tree-Based Network -- Crossing Families and Their Generalizations -- Which Sets of Strings are Pseudospherical?.

This book constitutes the refereed proceedings of the 27th International Symposium on Graph Drawing and Network Visualization, GD 2019, held in Prague, Czech Republic, in September 2019. The 42 papers and 12 posters presented in this volume were carefully reviewed and selected from 113 submissions. They were organized into the following topical sections: Cartograms and Intersection Graphs, Geometric Graph Theory, Clustering, Quality Metrics, Arrangements, A Low Number of Crossings, Best Paper in Track 1, Morphing and Planarity, Parameterized Complexity, Collinearities, Topological Graph Theory, Best Paper in Track 2, Level Planarity, Graph Drawing Contest Report, and Poster Abstracts.

ISBN: 9783030358020

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

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Graph Drawing and Network Visualization = 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings /
LDR:05397nam a22004095i 4500 001 1014228
003 DE-He213
005 20200701105638.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030358020 $9 978-3-030-35802-0
024 7 $a 10.1007/978-3-030-35802-0 $2 doi
035 $a 978-3-030-35802-0
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Graph Drawing and Network Visualization $h [electronic resource] : $b 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings / $c edited by Daniel Archambault, Csaba D. Tóth.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XXIII, 626 p. 460 illus., 244 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 Theoretical Computer Science and General Issues ; $v 11904
505 0 $a Cartograms and Intersection Graphs -- Stick Graphs with Length Constraints -- Representing Graphs and Hypergraphs by Touching Polygons in 3D -- Optimal Morphs of Planar Orthogonal Drawings II -- Computing Stable Demers Cartograms -- Geometric Graph Theory -- Bundled Crossings Revisited -- Crossing Numbers of Beyond-Planar Graphs -- On the 2-Colored Crossing Number -- Minimal Representations of Order Types by Geometric Graphs -- Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators -- Clustering -- A Quality Metric for Visualization of Clusters in Graphs -- Multi-level Graph Drawing using Infomap Clustering -- On Strict (Outer-)Conﬂuent Graphs -- Quality Metrics -- On the Edge-Length Ratio of Planar Graphs -- Node Overlap Removal Algorithms: A Comparative Study -- Graphs with large total angular resolution -- Arrangements -- Computing Height-Optimal Tangles Faster -- On Arrangements of Orthogonal Circles -- Extending Simple Drawings -- Coloring Hasse diagrams and disjointness graphs of curves -- A Low Number of Crossings -- Eﬃcient Generation of Diﬀerent Topological Representations of Graphs Beyond-Planarity -- The QuaSEFE Problem -- ChordLink: A New Hybrid Visualization Model -- Stress-Plus-X (SPX) Graph Layout -- Best Paper in Track 1 -- Exact Crossing Number Parameterized by Vertex Cover -- Morphing and Planarity -- Maximizing Ink in Partial Edge Drawings of k-Plane Graphs -- Graph Drawing with Morphing Partial Edges -- A Note on Universal Point Sets for Planar Graphs -- Parameterized Complexity -- Parameterized Algorithms for Book Embedding Problems -- Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs -- Collinearities -- 4-Connected Triangulations on Few Lines -- Line and Plane Cover Numbers Revisited -- Drawing planar graphs with few segments on a polynomial grid -- Variants of the Segment Number of a Graph -- Topological Graph Theory -- Local and Union Page Numbers -- Mixed Linear Layouts: Complexity, Heuristics, and Experiments -- Homotopy height, grid-major height and graph-drawing height -- On the Edge-Vertex Ratio of Maximal Thrackles -- Best Paper in Track 2 -- Symmetry Detection and Classiﬁcation in Drawings of Graphs -- Level Planarity -- An SPQR-Tree-Like Embedding Representation for Upward Planarity -- A Natural Quadratic Approach to the Generalized Graph Layering Problem -- Graph Stories in Small Area -- Level-Planar Drawings with Few Slopes -- Graph Drawing Contest Report -- Graph Drawing Contest Report -- Poster Abstracts -- A 1-planarity Testing and Embedding Algorithm -- Stretching Two Pseudolines in Planar Straight-Line Drawings -- Adventures in Abstraction: Reachability in Hierarchical Drawings -- On Topological Book Embedding for k-Plane Graphs -- On Compact RAC Drawings -- FPQ-choosable Planarity Testing -- Packing Trees into 1-Planar Graphs -- Geographic Network Visualization Techniques: A Work-In-Progress Taxonomy -- On the Simple Quasi Crossing Number of K 11 -- Minimising Crossings in a Tree-Based Network -- Crossing Families and Their Generalizations -- Which Sets of Strings are Pseudospherical?.
520 $a This book constitutes the refereed proceedings of the 27th International Symposium on Graph Drawing and Network Visualization, GD 2019, held in Prague, Czech Republic, in September 2019. The 42 papers and 12 posters presented in this volume were carefully reviewed and selected from 113 submissions. They were organized into the following topical sections: Cartograms and Intersection Graphs, Geometric Graph Theory, Clustering, Quality Metrics, Arrangements, A Low Number of Crossings, Best Paper in Track 1, Morphing and Planarity, Parameterized Complexity, Collinearities, Topological Graph Theory, Best Paper in Track 2, Level Planarity, Graph Drawing Contest Report, and Poster Abstracts.
650 0 $a Algorithms. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Optical data processing. $3 639187
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Data Structures and Information Theory. $3 1211601
650 2 4 $a Computer Imaging, Vision, Pattern Recognition and Graphics. $3 671334
700 1 $a Archambault, Daniel. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1200890
700 1 $a Tóth, Csaba D. $e editor. $1 https://orcid.org/0000-0002-8769-3190 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1308464
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030358013
776 0 8 $i Printed edition: $z 9783030358037
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-35802-0
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)