| Título : |
Graph Drawing and Network Visualization : 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings |
| Tipo de documento: |
documento electrónico |
| Autores: |
Biedl, Therese, ; Kerren, Andreas, |
| Mención de edición: |
1 ed. |
| Editorial: |
[s.l.] : Springer |
| Fecha de publicación: |
2018 |
| Número de páginas: |
XVIII, 666 p. 427 ilustraciones, 198 ilustraciones en color. |
| ISBN/ISSN/DL: |
978-3-030-04414-5 |
| Nota general: |
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. |
| Palabras clave: |
Procesamiento de datos Inteligencia artificial Infografía Ciencia de los datos Algoritmo Matemáticas discretas Matemáticas Informática Matemáticas discretas en informática |
| Índice Dewey: |
518.1 |
| Resumen: |
Este libro constituye las actas arbitradas del 26º Simposio Internacional sobre Dibujo de Gráficos y Visualización de Redes, GD 2018, celebrado en Barcelona, España, en septiembre de 2018. Los 41 artículos completos presentados en este volumen fueron cuidadosamente revisados y seleccionados entre 85 presentaciones. Estaban organizados en secciones temáticas denominadas: variantes de planaridad; dibujos ascendentes; dibujos del RAC; pedidos; cruces; ángulos de cruce; representaciones de contacto; gráficos y árboles especializados; dibujos parcialmente arreglados, experimentos; dibujos ortogonales; realizabilidad; y varios. El libro también contiene una charla invitada en papel completo y el informe del concurso de dibujo gráfico. |
| Nota de contenido: |
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 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. . |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
Graph Drawing and Network Visualization : 26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings [documento electrónico] / Biedl, Therese, ; Kerren, Andreas, . - 1 ed. . - [s.l.] : Springer, 2018 . - XVIII, 666 p. 427 ilustraciones, 198 ilustraciones en color. ISBN : 978-3-030-04414-5 Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
| Palabras clave: |
Procesamiento de datos Inteligencia artificial Infografía Ciencia de los datos Algoritmo Matemáticas discretas Matemáticas Informática Matemáticas discretas en informática |
| Índice Dewey: |
518.1 |
| Resumen: |
Este libro constituye las actas arbitradas del 26º Simposio Internacional sobre Dibujo de Gráficos y Visualización de Redes, GD 2018, celebrado en Barcelona, España, en septiembre de 2018. Los 41 artículos completos presentados en este volumen fueron cuidadosamente revisados y seleccionados entre 85 presentaciones. Estaban organizados en secciones temáticas denominadas: variantes de planaridad; dibujos ascendentes; dibujos del RAC; pedidos; cruces; ángulos de cruce; representaciones de contacto; gráficos y árboles especializados; dibujos parcialmente arreglados, experimentos; dibujos ortogonales; realizabilidad; y varios. El libro también contiene una charla invitada en papel completo y el informe del concurso de dibujo gráfico. |
| Nota de contenido: |
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 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. . |
| En línea: |
https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] |
| Link: |
https://biblioteca.umanizales.edu.co/ils/opac_css/index.php?lvl=notice_display&i |
|  |
Hacer una sugerencia Refinar búsqueda
