Graph Drawing: 17th International Symposium, GD 2009, Chicago, IL, USA, September 22-25, 2009. Revised Papers: Lecture Notes in Computer Science, cartea 5849
Editat de David Eppstein, Emden R. Gansneren Limba Engleză Paperback – 24 mar 2010
Din seria Lecture Notes in Computer Science
- 20% Preț: 741.34 lei
- 20% Preț: 340.22 lei
- 20% Preț: 343.43 lei
- 20% Preț: 315.18 lei
- 20% Preț: 327.41 lei
- 20% Preț: 1031.06 lei
- 20% Preț: 438.67 lei
- 20% Preț: 315.76 lei
- 20% Preț: 330.61 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 995.03 lei
- 20% Preț: 562.71 lei
- 20% Preț: 237.99 lei
- 20% Preț: 504.57 lei
- 20% Preț: 332.20 lei
- 15% Preț: 563.85 lei
- 20% Preț: 636.26 lei
- 5% Preț: 365.59 lei
- 20% Preț: 321.95 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.38 lei
- Preț: 370.38 lei
- 20% Preț: 172.68 lei
- 20% Preț: 315.76 lei
- 20% Preț: 662.78 lei
- 20% Preț: 256.26 lei
- 20% Preț: 440.36 lei
- 20% Preț: 626.79 lei
- 20% Preț: 566.70 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 579.38 lei
- 20% Preț: 301.94 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 330.61 lei
- 20% Preț: 1044.38 lei
- 20% Preț: 574.58 lei
- Preț: 399.17 lei
- 20% Preț: 802.24 lei
- 20% Preț: 569.11 lei
- 20% Preț: 1374.12 lei
- 20% Preț: 333.84 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.97 lei
Preț: 332.20 lei
Preț vechi: 415.25 lei
-20% Nou
Puncte Express: 498
Preț estimativ în valută:
63.58€ • 66.27$ • 52.93£
63.58€ • 66.27$ • 52.93£
Carte tipărită la comandă
Livrare economică 06-20 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783642118043
ISBN-10: 3642118046
Pagini: 448
Ilustrații: 426 p. 199 illus.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.68 kg
Ediția:2010
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: 3642118046
Pagini: 448
Ilustrații: 426 p. 199 illus.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.68 kg
Ediția:2010
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.- Why Are String Graphs So Beautiful?.- The Art of Cheating When Drawing a Graph.- Papers.- Drawing Hamiltonian Cycles with No Large Angles.- Area, Curve Complexity, and Crossing Resolution of Non-planar Graph Drawings.- On the Perspectives Opened by Right Angle Crossing Drawings.- Drawing 3-Polytopes with Good Vertex Resolution.- Planar Drawings of Higher-Genus Graphs.- Splitting Clusters to Get C-Planarity.- On the Characterization of Level Planar Trees by Minimal Patterns.- Characterization of Unlabeled Radial Level Planar Graphs.- Upward Planarization Layout.- More Flexible Radial Layout.- WiGis: A Framework for Scalable Web-Based Interactive Graph Visualizations.- Port Constraints in Hierarchical Layout of Data Flow Diagrams.- Fast Edge-Routing for Large Graphs.- Leftist Canonical Ordering.- Succinct Greedy Drawings Do Not Always Exist.- Geometric Simultaneous Embeddings of a Graph and a Matching.- Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs.- Removing Independently Even Crossings.- Manhattan-Geodesic Embedding of Planar Graphs.- Orthogonal Connector Routing.- On Rectilinear Drawing of Graphs.- Semi-bipartite Graph Visualization for Gene Ontology Networks.- On Open Problems in Biological Network Visualization.- A Novel Grid-Based Visualization Approach for Metabolic Networks with Advanced Focus&Context View.- Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs.- Drawing Trees in a Streaming Model.- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree.- Drawing Planar 3-Trees with Given Face-Areas.- 3D Visibility Representations by Regular Polygons.- Complexity of Some Geometric and Topological Problems.- On Planar Supports for Hypergraphs.- DAGmaps and ?-Visibility Representations ofDAGs.- Drawing Directed Graphs Clockwise.- An Improved Algorithm for the Metro-line Crossing Minimization Problem.- Layout with Circular and Other Non-linear Constraints Using Procrustes Projection.- Posters.- GMap: Drawing Graphs as Maps.- Using High Dimensions to Compare Drawings of Graphs.- On ?-Constrained Upward Topological Book Embeddings.- 4-Labelings and Grid Embeddings of Plane Quadrangulations.- IBM ILOG Graph Layout for Eclipse.- Layout Techniques Coupled with Web2.0-Based Business Process Modeling.- Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles.- Visualization of Complex BPEL Models.- DAGmaps and Dominance Relationships.- Scaffold Hunter – Interactive Exploration of Chemical Space.- Graph Drawing Contest.- Graph Drawing Contest Report.