Cantitate/Preț
Produs
Total produse
Vezi coșul
Graph Drawing and Network Visualization de David Auber

Graph Drawing and Network Visualization: Lecture Notes in Computer Science, cartea 12590

Editat de David Auber, Pavel Valtr
en Limba Engleză Paperback – 14 feb 2021
This book constitutes the refereed proceedings of the 28th International Symposium on Graph Drawing and Network Visualization, GD 2020, which was held during September 16-18, 2020. The conference was planned to take place in Vancouver, Canada, but changed to an online format due to the COVID-19 pandemic.
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33569 lei

Preț vechi: 41961 lei
-20%

Puncte Express: 504

Carte tipărită la comandă

Livrare economică 08-22 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

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

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.