Graph Drawing and Network Visualization: Lecture Notes in Computer Science, cartea 12590
Editat de David Auber, Pavel Valtren Limba Engleză Paperback – 14 feb 2021
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.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 335.69 lei
Preț vechi: 419.61 lei
-20%
Puncte Express: 504
Preț estimativ în valută:
59.36€ • 68.60$ • 51.28£
59.36€ • 68.60$ • 51.28£
Carte tipărită la comandă
Livrare economică 04-18 mai
Specificații
ISBN-13: 9783030687656
ISBN-10: 3030687651
Pagini: 564
Ilustrații: XVII, 546 p. 259 illus., 195 illus. in color.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.84 kg
Ediția:1st edition 2020
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3030687651
Pagini: 564
Ilustrații: XVII, 546 p. 259 illus., 195 illus. in color.
Dimensiuni: 155 x 235 x 31 mm
Greutate: 0.84 kg
Ediția:1st edition 2020
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
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.