| 000 | 04990nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-70904-6 | ||
| 003 | DE-He213 | ||
| 005 | 20240730184314.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2007 gw | s |||| 0|eng d | ||
| 020 |
_a9783540709046 _9978-3-540-70904-6 |
||
| 024 | 7 |
_a10.1007/978-3-540-70904-6 _2doi |
|
| 050 | 4 | _aQA76.9.M35 | |
| 050 | 4 | _aQA297.4 | |
| 072 | 7 |
_aUYAM _2bicssc |
|
| 072 | 7 |
_aPBD _2bicssc |
|
| 072 | 7 |
_aCOM014000 _2bisacsh |
|
| 072 | 7 |
_aUYAM _2thema |
|
| 072 | 7 |
_aPBD _2thema |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aGraph Drawing _h[electronic resource] : _b14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006, Revised Papers / _cedited by Michael Kaufmann, Dorothea Wagner. |
| 250 | _a1st ed. 2007. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2007. |
|
| 300 |
_aXIV, 454 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4372 |
|
| 505 | 0 | _aInvited 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. | |
| 650 | 0 |
_aComputer science _xMathematics. _93866 |
|
| 650 | 0 |
_aDiscrete mathematics. _912873 |
|
| 650 | 0 |
_aAlgorithms. _93390 |
|
| 650 | 0 |
_aComputer graphics. _94088 |
|
| 650 | 0 |
_aArtificial intelligence _xData processing. _921787 |
|
| 650 | 1 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
| 650 | 2 | 4 |
_aAlgorithms. _93390 |
| 650 | 2 | 4 |
_aComputer Graphics. _94088 |
| 650 | 2 | 4 |
_aData Science. _934092 |
| 700 | 1 |
_aKaufmann, Michael. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9135190 |
|
| 700 | 1 |
_aWagner, Dorothea. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9135191 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9135192 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540709039 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540835462 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v4372 _9135193 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-540-70904-6 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c92281 _d92281 |
||