Graph Drawing : 14th International Symposium, GD 2006, Germany, September, Revised Papers (Lecture Notes in Computer Science) / Kaufmann, Michael (EDT)/ Wagner, Dorothea (EDT)

グラフ描画２００６（会議録）<br>Graph Drawing : 14th International Symposium, GD 2006, Germany, September, Revised Papers (Lecture Notes in Computer Science) 〈Vol. 4372〉

個数：

グラフ描画２００６（会議録）
Graph Drawing : 14th International Symposium, GD 2006, Germany, September, Revised Papers (Lecture Notes in Computer Science) 〈Vol. 4372〉

Kaufmann, Michael (EDT)/ Wagner, Dorothea (EDT)

ウェブストア価格 ¥11,303（本体¥10,276）
Springer（2007/03発売）
外貨定価 US$ 54.99
ポイント 102pt

提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
【重要ご説明事項】
1. 納期遅延や、ご入手不能となる場合が若干ございます。
2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
3. 美品のご指定は承りかねます。

●3Dセキュア導入とクレジットカードによるお支払いについて

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Paperback:紙装版/ペーパーバック版／ページ数 454 p.
言語 ENG
商品コード 9783540709039
DDC分類 006.6

Full Description

This book constitutes the thoroughly refereed post-proceedings of the 14th International Symposium on Graph Drawing, GD 2006, held in Karlsruhe, Germany. The 33 revised full papers and 5 revised short papers presented together with 2 invited talks, 1 system demo, 2 poster papers address all current aspects in graph drawing, ranging from foundational and methodological issues to applications for various classes of graphs in a variety of fields.

Invited Talks.- The Number of Triangulations on Planar Point Sets.- The Algorithmic Beauty of Digital Nature.- Papers.- Integrating Edge Routing into Force-Directed Layout.- Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree.- SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding.- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data.- Angle and Distance Constraints on Tree Drawings.- Schematisation of Tree Drawings.- Trees with Convex Faces and Optimal Angles.- Three-Dimensional Drawings of Bounded Degree Trees.- Simultaneous Graph Embedding with Bends and Circular Arcs.- Embedding Graphs Simultaneously with Fixed Edges.- Drawing Cubic Graphs with at Most Five Slopes.- Planarity Testing and Optimal Edge Insertion with Embedding Constraints.- Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs.- Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor.- On the Crossing Number of Almost Planar Graphs.- On the Decay of Crossing Numbers.- How Important Is the "Mental Map"? - An Empirical Investigation of a Dynamic Graph Layout Algorithm.- Computing Geometric Minimum-Dilation Graphs Is NP-Hard.- Chordal Graphs as Intersection Graphs of Pseudosegments.- Parameterized st-Orientations of Graphs: Algorithms and Experiments.- Straight-Line Drawing of Quadrangulations.- Visualizing Large and Clustered Networks.- Partitioned Drawings.- Path Simplification for Metro Map Layout.- Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps.- Upright-Quad Drawing of st-Planar Learning Spaces.- Choosing Colors for Geometric Graphs Via Color Space Embeddings.- Morphing Planar Graphs in SphericalSpace.- k-Colored Point-Set Embeddability of Outerplanar Graphs.- Thickness of Bar 1-Visibility Graphs.- A New Approximation Algorithm for Bend Minimization in the Kandinsky Model.- Radial Drawings of Graphs: Geometric Constraints and Trade-Offs.- Characterization of Unlabeled Level Planar Trees.- Drawing Bipartite Graphs on Two Curves.- Improved Circular Layouts.- Controllable and Progressive Edge Clustering for Large Networks.- Biclique Edge Cover Graphs and Confluent Drawings.- Schnyder Woods and Orthogonal Surfaces.- Partitions of Graphs into Trees.- Posters.- The Website for Graph Visualization Software References (GVSR).- Smoother Transitions Between Breadth-First-Spanning-Tree-Based Drawings.- Corrections.- Fast Node Overlap Removal—Correction.- Graph Drawing Contest.- Graph-Drawing Contest Report.