000 05800nam a22006135i 4500
001 978-3-030-04414-5
003 DE-He213
005 20240730171710.0
007 cr nn 008mamaa
008 181217s2018 sz | s |||| 0|eng d
020 _a9783030044145
_9978-3-030-04414-5
024 7 _a10.1007/978-3-030-04414-5
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aGraph Drawing and Network Visualization
_h[electronic resource] :
_b26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings /
_cedited by Therese Biedl, Andreas Kerren.
250 _a1st ed. 2018.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2018.
300 _aXVIII, 666 p. 427 illus., 198 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11282
505 0 _aInvited 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 DiscreteOllivier-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 _aThis 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 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aComputer graphics.
_94088
650 0 _aArtificial intelligence.
_93407
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData Science.
_934092
650 2 4 _aComputer Graphics.
_94088
650 2 4 _aArtificial Intelligence.
_93407
700 1 _aBiedl, Therese.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9100025
700 1 _aKerren, Andreas.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9100027
710 2 _aSpringerLink (Online service)
_9100030
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030044138
776 0 8 _iPrinted edition:
_z9783030044152
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11282
_9100031
856 4 0 _uhttps://doi.org/10.1007/978-3-030-04414-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c87762
_d87762