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ț: 1020.28 lei -
Preț: 395.25 lei - 20%
Preț: 327.36 lei - 20%
Preț: 984.64 lei - 20%
Preț: 400.77 lei - 20%
Preț: 328.94 lei - 20%
Preț: 340.04 lei - 20%
Preț: 487.46 lei - 20%
Preț: 629.71 lei - 20%
Preț: 386.08 lei - 20%
Preț: 489.11 lei - 20%
Preț: 556.96 lei - 20%
Preț: 560.93 lei - 15%
Preț: 558.12 lei - 20%
Preț: 782.57 lei - 20%
Preț: 679.09 lei - 20%
Preț: 330.54 lei - 20%
Preț: 733.68 lei - 20%
Preț: 435.28 lei - 20%
Preț: 375.72 lei - 20%
Preț: 342.61 lei - 20%
Preț: 432.78 lei - 20%
Preț: 904.16 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 373.80 lei - 20%
Preț: 400.17 lei - 20%
Preț: 478.59 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 620.33 lei - 20%
Preț: 731.97 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 403.00 lei - 20%
Preț: 563.29 lei - 20%
Preț: 324.19 lei - 20%
Preț: 793.92 lei - 20%
Preț: 336.86 lei - 20%
Preț: 327.36 lei - 20%
Preț: 573.45 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 850.42 lei - 20%
Preț: 560.93 lei - 20%
Preț: 558.53 lei - 20%
Preț: 631.96 lei - 20%
Preț: 568.70 lei - 20%
Preț: 488.90 lei - 20%
Preț: 293.24 lei
Preț: 332.29 lei
Preț vechi: 415.36 lei
-20%
Puncte Express: 498
Preț estimativ în valută:
58.76€ • 67.38$ • 50.78£
58.76€ • 67.38$ • 50.78£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
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.