國立虎尾科技大學 |

Graph Drawing and Network Visualization = 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Graph Drawing and Network Visualization/ edited by Therese Biedl, Andreas Kerren.
其他題名:	26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings /
其他作者:	Biedl, Therese.
面頁冊數:	XVIII, 666 p. 427 illus., 198 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-030-04414-5
ISBN:	9783030044145

Graph Drawing and Network Visualization = 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings /
Graph Drawing and Network Visualization26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings /[electronic resource] :edited by Therese Biedl, Andreas Kerren. - 1st ed. 2018. - XVIII, 666 p. 427 illus., 198 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11282. - Theoretical Computer Science and General Issues ;9163.

Invited Talk -- Image-Based Graph Visualization: Advances and Challenges -- Planarity Variants -- Clustered Planarity = Flat Clustered Planarity -- Level Planarity: Transitivity vs. Even Crossings -- Short Plane Supports for Spatial Hypergraphs -- Turning Cliques into Paths to Achieve Planarity -- Upward Drawings -- Universal Slope Sets for Upward Planar Drawings -- Upward Planar Morphs -- Visualizing the Template of a Chaotic Attractor -- RAC drawings -- On RAC Drawings of Graphs with one Bend per Edge -- Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends -- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles -- Best paper Track 2 -- Aesthetic Discrimination of Graph Layouts -- Orders -- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width -- The Queue-Number of Posets of Bounded Width or Height -- Queue Layouts of Planar 3-Trees -- Crossings -- Crossing Minimization in Perturbed Drawings -- The Number of Crossings in Multigraphs with No Empty Lens -- Crossing Numbers and Stress of Random Graphs -- Crossing angles -- A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution -- A Greedy Heuristic for Crossing-Angle Maximization -- Contact representations -- Recognition and Drawing of Stick Graphs -- On Contact Graphs of Paths on a Grid -- Specialized graphs and trees -- On the Area-Universality of Triangulations -- Monotone Drawings of k-Inner Planar Graphs -- On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples -- How to Fit a Tree in a Box -- Best paper Track 1 -- Pole Dancing: 3D Morphs for Tree Drawings -- Partially fixed drawings -- The Complexity of Drawing a Graph in a Polygonal Region -- Inserting an Edge into a Geometric Embedding -- β-Stars or On Extending a Drawing of a Connected Subgraph -- Experiments -- Perception of Symmetries in Drawings of Graphs -- Network Alignment by Discrete Ollivier-Ricci Flow -- Same Stats, Different Graphs (Graph Statistics and Why We Need Graph Drawings) -- Orthogonal drawings -- Bend-minimum Orthogonal Drawings in Quadratic Time -- Greedy Rectilinear Drawings -- Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity -- Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs -- Realizability -- Realization and Connectivity of the Graphs of Origami Flat Foldings -- Arrangements of Pseudocircles: On Circularizability -- The Weighted Barycenter Drawing Recognition Problem -- Miscellaneous -- Algorithms and Bounds for Drawing Directed Graphs -- Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity -- Graph Drawing Contest Report. .

This book constitutes the refereed proceedings of the 26th International Symposium on Graph Drawing and Network Visualization, GD 2018, held in Barcelona, Spain, in September 2018. The 41 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: planarity variants; upward drawings; RAC drawings; orders; crossings; crossing angles; contact representations; specialized graphs and trees; partially fixed drawings, experiments; orthogonal drawings; realizability; and miscellaneous. The book also contains one invited talk in full paper length and the Graph Drawing contest report.

ISBN: 9783030044145

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

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Graph Drawing and Network Visualization = 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings /
LDR:04893nam a22004095i 4500 001 990125
003 DE-He213
005 20200702164308.0
007 cr nn 008mamaa
008 201225s2018 gw | s |||| 0|eng d
020 $a 9783030044145 $9 978-3-030-04414-5
024 7 $a 10.1007/978-3-030-04414-5 $2 doi
035 $a 978-3-030-04414-5
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 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings / $c edited by Therese Biedl, Andreas Kerren.
250 $a 1st ed. 2018.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a XVIII, 666 p. 427 illus., 198 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 11282
505 0 $a Invited Talk -- Image-Based Graph Visualization: Advances and Challenges -- Planarity Variants -- Clustered Planarity = Flat Clustered Planarity -- Level Planarity: Transitivity vs. Even Crossings -- Short Plane Supports for Spatial Hypergraphs -- Turning Cliques into Paths to Achieve Planarity -- Upward Drawings -- Universal Slope Sets for Upward Planar Drawings -- Upward Planar Morphs -- Visualizing the Template of a Chaotic Attractor -- RAC drawings -- On RAC Drawings of Graphs with one Bend per Edge -- Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends -- Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles -- Best paper Track 2 -- Aesthetic Discrimination of Graph Layouts -- Orders -- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width -- The Queue-Number of Posets of Bounded Width or Height -- Queue Layouts of Planar 3-Trees -- Crossings -- Crossing Minimization in Perturbed Drawings -- The Number of Crossings in Multigraphs with No Empty Lens -- Crossing Numbers and Stress of Random Graphs -- Crossing angles -- A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution -- A Greedy Heuristic for Crossing-Angle Maximization -- Contact representations -- Recognition and Drawing of Stick Graphs -- On Contact Graphs of Paths on a Grid -- Specialized graphs and trees -- On the Area-Universality of Triangulations -- Monotone Drawings of k-Inner Planar Graphs -- On L-shaped Point Set Embeddings of Trees: First Non-embeddable Examples -- How to Fit a Tree in a Box -- Best paper Track 1 -- Pole Dancing: 3D Morphs for Tree Drawings -- Partially fixed drawings -- The Complexity of Drawing a Graph in a Polygonal Region -- Inserting an Edge into a Geometric Embedding -- β-Stars or On Extending a Drawing of a Connected Subgraph -- Experiments -- Perception of Symmetries in Drawings of Graphs -- Network Alignment by Discrete Ollivier-Ricci Flow -- Same Stats, Different Graphs (Graph Statistics and Why We Need Graph Drawings) -- Orthogonal drawings -- Bend-minimum Orthogonal Drawings in Quadratic Time -- Greedy Rectilinear Drawings -- Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity -- Ortho-polygon Visibility Representations of 3-connected 1-plane Graphs -- Realizability -- Realization and Connectivity of the Graphs of Origami Flat Foldings -- Arrangements of Pseudocircles: On Circularizability -- The Weighted Barycenter Drawing Recognition Problem -- Miscellaneous -- Algorithms and Bounds for Drawing Directed Graphs -- Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity -- Graph Drawing Contest Report. .
520 $a This book constitutes the refereed proceedings of the 26th International Symposium on Graph Drawing and Network Visualization, GD 2018, held in Barcelona, Spain, in September 2018. The 41 full papers presented in this volume were carefully reviewed and selected from 85 submissions. They were organized in topical sections named: planarity variants; upward drawings; RAC drawings; orders; crossings; crossing angles; contact representations; specialized graphs and trees; partially fixed drawings, experiments; orthogonal drawings; realizability; and miscellaneous. The book also contains one invited talk in full paper length and the Graph Drawing contest report.
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 Computer graphics. $3 561602
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Computer Graphics. $3 669895
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Biedl, Therese. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1211630
700 1 $a Kerren, Andreas. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 681552
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030044138
776 0 8 $i Printed edition: $z 9783030044152
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-04414-5
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)