Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers: Lecture Notes in Computer Science, cartea 4875
Editat de Seok-Hee Hong, Takao Nishizeki, Wu Quanen Limba Engleză Paperback – 28 ian 2008
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ț: 326.55 lei
Preț vechi: 408.19 lei
-20%
Puncte Express: 490
Preț estimativ în valută:
57.74€ • 66.22$ • 49.91£
57.74€ • 66.22$ • 49.91£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540775362
ISBN-10: 3540775366
Pagini: 422
Ilustrații: XIII, 401 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.61 kg
Ediția:2008
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: 3540775366
Pagini: 422
Ilustrații: XIII, 401 p.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.61 kg
Ediția:2008
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
Invited Talks.- Computing Symmetries of Combinatorial Objects.- Large-Scale Graphics: Digital Nature and Laser Projection.- Papers.- Crossing Number of Graphs with Rotation Systems.- A Bipartite Strengthening of the Crossing Lemma.- Improvement on the Decay of Crossing Numbers.- Crossing Numbers and Parameterized Complexity.- Characterization of Unlabeled Level Planar Graphs.- Cyclic Level Planarity Testing and Embedding.- Practical Level Planarity Testing and Layout with Embedding Constraints.- Minimum Level Nonplanar Patterns for Trees.- Straight-Line Orthogonal Drawings of Binary and Ternary Trees.- Polynomial Area Bounds for MST Embeddings of Trees.- Moving Vertices to Make Drawings Plane.- Point-Set Embedding of Trees with Edge Constraints.- Representation of Planar Hypergraphs by Contacts of Triangles.- The Complexity of Several Realizability Problems for Abstract Topological Graphs.- Efficient Extraction of Multiple Kuratowski Subdivisions.- Cover Contact Graphs.- Matched Drawings of Planar Graphs.- Maximum Upward Planar Subgraphs of Embedded Planar Digraphs.- Minimizing the Area for Planar Straight-Line Grid Drawings.- On Planar Polyline Drawings.- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection.- Line Crossing Minimization on Metro Maps.- Algorithms for Multi-criteria One-Sided Boundary Labeling.- Multi-circular Layout of Micro/Macro Graphs.- Constrained Simultaneous and Near-Simultaneous Embeddings.- Simultaneous Geometric Graph Embeddings.- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces.- Clustered Planarity: Small Clusters in Eulerian Graphs.- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge.- Colorability in Orthogonal Graph Drawing.- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs.- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices.- LunarVis – Analytic Visualizations of Large Graphs.- Visualizing Internet Evolution on the Autonomous Systems Level.- Treemaps for Directed Acyclic Graphs.- Drawing Graphs with GLEE.- Graph Drawing Contest.- Graph Drawing Contest Report.