Graph Drawing: 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers: Lecture Notes in Computer Science, cartea 2912
Editat de Guiseppe Liottaen Limba Engleză Paperback – 13 ian 2004
Din seria Lecture Notes in Computer Science
- 20% Preț: 1040.03 lei
- 20% Preț: 333.46 lei
- 20% Preț: 335.08 lei
- 20% Preț: 444.17 lei
- 20% Preț: 238.01 lei
- 20% Preț: 333.46 lei
- 20% Preț: 438.69 lei
- Preț: 440.52 lei
- 20% Preț: 336.71 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 632.22 lei
- 17% Preț: 427.22 lei
- 20% Preț: 641.78 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1053.45 lei
- 20% Preț: 579.56 lei
- Preț: 373.56 lei
- 20% Preț: 330.23 lei
- 15% Preț: 429.74 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1386.07 lei
- 20% Preț: 1003.66 lei
- 20% Preț: 567.60 lei
- 20% Preț: 575.48 lei
- 20% Preț: 571.63 lei
- 20% Preț: 747.79 lei
- 15% Preț: 568.74 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 346.40 lei
- 20% Preț: 574.05 lei
- Preț: 402.62 lei
- 20% Preț: 584.40 lei
- 20% Preț: 747.79 lei
- 20% Preț: 809.19 lei
- 20% Preț: 649.49 lei
- 20% Preț: 343.16 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 583.07 lei
Preț vechi: 728.83 lei
-20% Nou
Puncte Express: 875
Preț estimativ în valută:
111.59€ • 115.91$ • 92.69£
111.59€ • 115.91$ • 92.69£
Carte tipărită la comandă
Livrare economică 29 ianuarie-04 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540208310
ISBN-10: 3540208313
Pagini: 564
Ilustrații: XIV, 542 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.78 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540208313
Pagini: 564
Ilustrații: XIV, 542 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.78 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Planarity and Planar Drawings.- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way.- An Experimental Study of Crossing Minimization Heuristics.- Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm.- Bounds and Methods for k-Planar Crossing Numbers.- Geometric Graph Theory.- How Many Ways Can One Draw a Graph?.- Two Results on Intersection Graphs of Polygons.- Stretching of Jordan Arc Contact Systems.- Noncrossing Hamiltonian Paths in Geometric Graphs.- Applications and Systems – Part I.- GraphAEL: Graph Animations with Evolving Layouts.- Visualizing Related Metabolic Pathways in Two and a Half Dimensions.- GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon – System Demonstration.- Straight-Line, Circular, and Circular-Arc Drawings.- Area-Efficient Drawings of Outerplanar Graphs.- A Framework for User-Grouped Circular Drawings.- Fixed-Location Circular-Arc Drawing of Planar Graphs.- A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio.- Symmetries.- An Integer Programming Approach to Fuzzy Symmetry Detection.- Barycentric Drawings of Periodic Graphs.- 3D-Drawings.- Three-Dimensional Grid Drawings with Sub-quadratic Volume.- Laying Out Iterated Line Digraphs Using Queues.- Track Drawings of Graphs with Constant Queue Number.- 3D Visibility Representations of Complete Graphs.- Drawing Series-Parallel Graphs on Restricted Integer 3D Grids.- Nearly Optimal Three Dimensional Layout of Hypercube Networks.- Embeddings and Triangulations.- Graph Embedding with Minimum Depth and Maximum External Face.- More Efficient Generation of Plane Triangulations.- Planar Embeddings of Graphs with Specified Edge Lengths.- Applicationsand Systems – Part II.- BGPlay: A System for Visualizing the Interdomain Routing Evolution.- GraphEx: An Improved Graph Translation Service.- A Constrained, Force-Directed Layout Algorithm for Biological Pathways.- Intersection-Free Morphing of Planar Graphs.- Fixed Parameter Tractability.- Fixed Parameter Algorithms for one-sided crossing minimization Revisited.- Experiments with the Fixed-Parameter Approach for Two-Layer Planarization.- Clusters, Cuts, and Orthogonal Drawings.- Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles.- Convex Drawing for c-Planar Biconnected Clustered Graphs.- Layout of Directed Hypergraphs with Orthogonal Hyperedges.- No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs.- k-Level Drawings.- Radial Level Planarity Testing and Embedding in Linear Time.- An Improved Approximation to the One-Sided Bilayer Drawing.- Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves.- Force Directed and Energy-Based Techniques.- An Energy Model for Visual Graph Clustering.- Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes.- Axis-by-Axis Stress Minimization.- Drawing Graphs with Nonuniform Nodes Using Potential Fields.- Surfaces and Diagrams.- Drawing Area-Proportional Venn and Euler Diagrams.- Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface.- Posters.- Degree Navigator TM : The Journey of a Visualization Software.- HexGraph: Applying Graph Drawing Algorithms to the Game of Hex.- GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions.- Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework.- The Puzzle Layout Problem.- Visual Data Mining with ILOG Discovery.- Graph Drawing Contest.- GraphDrawing Contest Report.- Invited Talks.- Engineering and Visualizing Algorithms.- Report on the Invited Lecture by Pat Hanrahan, Titled “On Being in the Right Space”.- Open Problems.- Selected Open Problems in Graph Drawing.
Caracteristici
Includes supplementary material: sn.pub/extras