Graph Drawing: 13 th International Symposium, GD 2005, Limerick, Ireland, September 12-14, 2005, Revised Papers: Lecture Notes in Computer Science, cartea 3843
Editat de Patrick Healy, Nikola S. Nikoloven Limba Engleză Paperback – 25 ian 2006
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 332.44 lei
Preț vechi: 415.55 lei
-20% Nou
Puncte Express: 499
Preț estimativ în valută:
63.62€ • 67.12$ • 53.02£
63.62€ • 67.12$ • 53.02£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540314257
ISBN-10: 3540314253
Pagini: 560
Ilustrații: XVII, 536 p.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.78 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540314253
Pagini: 560
Ilustrații: XVII, 536 p.
Dimensiuni: 155 x 235 x 35 mm
Greutate: 0.78 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Papers.- Crossings and Permutations.- Morphing Planar Graphs While Preserving Edge Directions.- Dynamic Spectral Layout of Small Worlds.- Exact Crossing Minimization.- On Embedding a Cycle in a Plane Graph.- On Rectilinear Duals for Vertex-Weighted Plane Graphs.- Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness.- Drawing K n in Three Dimensions with One Bend Per Edge.- Small Area Drawings of Outerplanar Graphs.- Volume Requirements of 3D Upward Drawings.- How to Embed a Path onto Two Sets of Points.- Upward Spirality and Upward Planarity Testing.- Graph Treewidth and Geometric Thickness Parameters.- Stress Majorization with Orthogonal Ordering Constraints.- Fast Node Overlap Removal.- Delta-Confluent Drawings.- Transversal Structures on Triangulations, with Application to Straight-Line Drawing.- A Hybrid Model for Drawing Dynamic and Evolving Graphs.- Two Trees Which Are Self–intersecting When Drawn Simultaneously.- C-Planarity of Extrovert Clustered Graphs.- Non-planar Core Reduction of Graphs.- An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs.- Hierarchical Layouts of Directed Graphs in Three Dimensions.- Layout Effects on Sociogram Perception.- On Edges Crossing Few Other Edges in Simple Topological Complete Graphs.- On Balloon Drawings of Rooted Trees.- Convex Drawings of Plane Graphs of Minimum Outer Apices.- Energy-Based Clustering of Graphs with Nonuniform Degrees.- A Mixed-Integer Program for Drawing High-Quality Metro Maps.- Crossing Number of Toroidal Graphs.- Drawing Graphs Using Modular Decomposition.- Applications of Parameterized st-Orientations in Graph Drawing Algorithms.- Complexity Results for Three-Dimensional Orthogonal Graph Drawing.- On Extending a Partial Straight-LineDrawing.- Odd Crossing Number Is Not Crossing Number.- Minimum Depth Graph Embeddings and Quality of the Drawings: An Experimental Analysis.- No-bend Orthogonal Drawings of Series-Parallel Graphs.- Parallel-Redrawing Mechanisms, Pseudo-Triangulations and Kinetic Planar Graphs.- Proper and Planar Drawings of Graphs on Three Layers.- Incremental Connector Routing.- An Application of Well-Orderly Trees in Graph Drawing.- Software Demonstrations.- GEOMI: GEOmetry for Maximum Insight.- WhatsOnWeb: Using Graph Drawing to Search the Web.- Drawing Clustered Graphs in Three Dimensions.- Posters.- BLer: A Boundary Labeller for Technical Drawings.- D-Dupe: An Interactive Tool for Entity Resolution in Social Networks.- A New Method for Efficiently Generating Planar Graph Visibility Representations.- SDE: Graph Drawing Using Spectral Distance Embedding.- MultiPlane: A New Framework for Drawing Graphs in Three Dimensions.- Visualizing Graphs as Trees: Plant a Seed and Watch it Grow.- On Straightening Low-Diameter Unit Trees.- Mixed Upward Planarization – Fast and Robust.- Workshop on Network Analysis and Visualisation.- Network Analysis and Visualisation.- Graph Drawing Contest.- Graph-Drawing Contest Report.- Invited Talks.- Minimum Cycle Bases and Surface Reconstruction.- Hierarchy Visualization: From Research to Practice.