000 | 04997nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-642-36763-2 | ||
003 | DE-He213 | ||
005 | 20200421111842.0 | ||
007 | cr nn 008mamaa | ||
008 | 130217s2013 gw | s |||| 0|eng d | ||
020 |
_a9783642367632 _9978-3-642-36763-2 |
||
024 | 7 |
_a10.1007/978-3-642-36763-2 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aCOM018000 _2bisacsh |
|
072 | 7 |
_aMAT008000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aGraph Drawing _h[electronic resource] : _b20th International Symposium, GD 2012, Redmond, WA, USA, September 19-21, 2012, Revised Selected Papers / _cedited by Walter Didimo, Maurizio Patrignani. |
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2013. |
|
300 |
_aXVI, 582 p. 231 illus. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v7704 |
|
505 | 0 | _aFlips -- 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 Graph Recognition -- Interactive Random Graph Generation with Evolutionary Algorithms. | |
520 | _aThis 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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer communication systems. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aComputers. | |
650 | 0 | _aUser interfaces (Computer systems). | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aModels and Principles. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
650 | 2 | 4 | _aUser Interfaces and Human Computer Interaction. |
700 | 1 |
_aDidimo, Walter. _eeditor. |
|
700 | 1 |
_aPatrignani, Maurizio. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783642367625 |
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v7704 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-36763-2 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-LNC | ||
942 | _cEBK | ||
999 |
_c55636 _d55636 |