Del i serien Lecture Notes in Computer Science

Graph Drawing

20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers

Häftad, Engelska, 2013

699 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Symposium on Graph Drawing, GD 2012, held in Redmond, WA, USA, in September 2012. The 42 revised full papers presented together with 4 revised short papers and 8 poster descriptions were carefully reviewed and selected from 92 submissions. They cover a wide range of topics in two main tracks: combinatorial and algorithmic aspects, and visualization systems and interfaces. In addition, reports of the 19th Annual Graph Drawing Contest, which was held during the conference, and of a workshop on theory and practice of graph drawing to celebrate Professor Peter Eades' 60th birthday are included in the volume.

Produktinformation

Utgivningsdatum2013-02-20
Mått155 x 235 x 33 mm
Vikt896 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor582
Upplaga2013
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783642367625

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Hårdvara inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

Flips.- Interactive Network Exploration to Derive Insights: Filtering, Clustering, Grouping, and Simplification.- Counting Plane Graphs: Cross-Graph Charging.- Disconnectivity and Relative Positions in Simultaneous Embeddings.- Graph Drawing in the Cloud: Privately Visualizing Relational Data Using Small Working Storage.- Graph Drawing by Classical Multidimensional Scaling: New Perspectives.- Progress on Partial Edge Drawings.- Implementing a Partitioned 2-Page Book Embedding Testing Algorithm.- Shrinking the Search Space for Clustered Planarity.- Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs.- The Approximate Rectangle of Influence Drawability Problem.- Planar Lombardi Drawings for Subcubic Graphs.- Circle-Representations of Simple 4-Regular Planar Graphs.- Smooth Orthogonal Layouts.- Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants.- Planar Graphs as VPG-Graphs.- Proportional Contact Representations of 4-Connected Planar Graphs.- Edge-Weighted Contact Representations of Planar Graphs.- Column-Based Graph Layouts.- Upward Planarity Testing via SAT.- Self-approaching Graphs.- Homotopic C-Oriented Routing.- Covering Paths for Planar Point Sets.- On the Density of Maximal 1-Planar Graphs.- Testing Maximal 1-Planarity of Graphs with a Rotation System in Linear Time.- Tangles and Degenerate Tangles.- The Visible Perimeter of an Arrangement of Disks.- Canonical Ordering for Triangulations on the Cylinder, with Applications to Periodic Straight-Line Drawings.- Planar Preprocessing for Spring Embedders.- StreamEB: Stream Edge Bundling.- Drawing Clustered Graphs as Topographic.- On The Usability of Lombardi Graph Drawings.- Drawing Metro Maps Using B´ezier Curves.- Mental Map Preservation Helps User Orientation in Dynamic Graphs.- Clustering, Visualizing, and Navigating for Large Dynamic Graphs.- DAGView: An Approach for Visualizing Large Graphs.- Time-Space Maps from Triangulations.- Graph Drawing in TikZ.- Optical GraphRecognition.- Interactive Random Graph Generation with Evolutionary Algorithms.