Graph Drawing: 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers: Lecture Notes in Computer Science, cartea 2528
Editat de Stephen G. Kobourov, Michael T. Goodrichen Limba Engleză Paperback – 30 oct 2002
Din seria Lecture Notes in Computer Science
- 20% Preț: 1053.72 lei
- 20% Preț: 337.82 lei
- 20% Preț: 339.43 lei
- 20% Preț: 449.99 lei
- 20% Preț: 238.01 lei
- 20% Preț: 337.82 lei
- 20% Preț: 438.69 lei
- Preț: 446.28 lei
- 20% Preț: 341.10 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 640.52 lei
- 17% Preț: 427.22 lei
- 20% Preț: 650.20 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1067.33 lei
- 20% Preț: 587.17 lei
- Preț: 378.43 lei
- 20% Preț: 334.54 lei
- 15% Preț: 435.36 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1404.34 lei
- 20% Preț: 1016.88 lei
- 20% Preț: 575.04 lei
- 20% Preț: 575.48 lei
- 20% Preț: 579.12 lei
- 20% Preț: 757.61 lei
- 15% Preț: 576.20 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 350.92 lei
- 20% Preț: 581.57 lei
- Preț: 407.85 lei
- 20% Preț: 592.06 lei
- 20% Preț: 757.61 lei
- 20% Preț: 819.86 lei
- 20% Preț: 649.49 lei
- 20% Preț: 347.62 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 335.87 lei
Preț vechi: 419.84 lei
-20% Nou
Puncte Express: 504
Preț estimativ în valută:
64.33€ • 66.27$ • 53.88£
64.33€ • 66.27$ • 53.88£
Carte tipărită la comandă
Livrare economică 24 februarie-10 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540001584
ISBN-10: 3540001581
Pagini: 412
Ilustrații: XIV, 398 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 kg
Ediția:2002
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540001581
Pagini: 412
Ilustrații: XIV, 398 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.58 kg
Ediția:2002
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Papers.- Sketch-Driven Orthogonal Graph Drawing.- Maintaining the Mental Map for Circular Drawings.- Graphs, They Are Changing.- Drawing Graphs on Two and Three Lines.- Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.- Drawing Outer-Planar Graphs in O(n log n )Area.- Computing Labeled Orthogonal Drawings.- Computing and Drawing Isomorphic Subgraphs.- A Group-Theoretic Method for Drawing Graphs Symmetrically.- A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem.- Geometric Systems of Disjoint Representatives.- An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization.- Simple and Efficient Bilayer Cross Counting.- Orthogonal 3D Shapes of Theta Graphs.- Separating Thickness from Geometric Thickness.- Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs.- Compact Encodings of Planar Orthogonal Drawings.- Fractional Lengths and Crossing Numbers.- Drawing Directed Graphs Using One-Dimensional Optimization.- Graph Drawing by High-Dimensional Embedding.- Advances in C-Planarity Testing of Clustered Graphs.- HGV: A Library for Hierarchies, Graphs, and Views.- Rectangular Drawings of Planar Graphs.- Extended Rectangular Drawings of Plane Graphs with Designated Corners.- RINGS: A Technique for Visualizing Large Hierarchies.- Applying Crossing Reduction Strategies to Layered Compound Graphs.- Crossing Reduction by Windows Optimization.- Geometric Graphs with No Self-intersecting Path of Length Three.- Two New Heuristics for Two-Sided Bipartite Graph Drawing.- Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio.- Some Applications of Orderly Spanning Trees in Graph Drawing.- Improving Walker’s Algorithm to Run in Linear Time.- Semi-dynamic Orthogonal Drawings ofPlanar Graphs.- Software Demonstrations.- Graph Layout for Workflow Applications with ILOG JViews.- InterViewer: Dynamic Visualization of Protein-Protein Interactions.- Some Modifications of Sugiyama Approach.- A Framework for Complexity Management in Graph Visualization.- A Partitioned Approach to Protein Interaction Mapping.- Camera Position Reconstruction and Tight Direction Networks.- Demonstration of a Preprocessor for the Spring Embedder.- Graph Drawing Contest.- Graph-Drawing Contest Report.- Invited Talks.- Techniques for Interactive Graph Drawing.- Drawing Venn Diagrams.
Caracteristici
Includes supplementary material: sn.pub/extras