| 000 | 05365nam a22006015i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-31843-9 | ||
| 003 | DE-He213 | ||
| 005 | 20240730181622.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100705s2005 gw | s |||| 0|eng d | ||
| 020 |
_a9783540318439 _9978-3-540-31843-9 |
||
| 024 | 7 |
_a10.1007/b105810 _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] : _b12th International Symposium, GD 2004, New York, NY, USA, September 29-October 2, 2004, Revised Selected Papers / _cedited by Janos Pach. |
| 250 | _a1st ed. 2005. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2005. |
|
| 300 |
_aXII, 540 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 ; _v3383 |
|
| 505 | 0 | _aPapers -- Reconfiguring Triangulations with Edge Flips and Point Moves -- Drawing Power Law Graphs -- Hexagonal Grid Drawings: Algorithms and Lower Bounds -- Improved Bounds for the Number of (? k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K n -- On the Realizable Weaving Patterns of Polynomial Curves in -- Drawing the AS Graph in 2.5 Dimensions -- Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps -- Convex Drawings of 3-Connected Plane Graphs -- Partitions of Complete Geometric Graphs into Plane Trees -- Additional PC-Tree Planarity Conditions -- GraphML Transformation -- Clustering Cycles into Cycles of Clusters -- Unit Bar-Visibility Layouts of Triangulated Polygons -- Really Straight Graph Drawings -- Layouts of Graph Subdivisions -- Label Number Maximization in the Slider Model -- An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing -- Random Geometric Graph Diameter in the Unit Disk with ? p Metric -- Algorithms for Drawing Media -- Confluent Layered Drawings -- Simultaneous Embedding of Planar Graphs with Few Bends -- A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction -- Contact and Intersection Representations -- Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs -- Graph Drawing by Stress Majorization -- Computing Radial Drawings on the Minimum Number of Circles -- Hamiltonian-with-Handles Graphs and the k-Spine Drawability Problem -- Distributed Graph Layout for Sensor Networks -- Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm -- Building Blocks of Upward Planar Digraphs -- A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs -- Train Tracks and Confluent Drawings -- The Three DimensionalLogic Engine -- Long Alternating Paths in Bicolored Point Sets -- Intersection Reverse Sequences and Geometric Applications -- New Exact Results and Bounds for Bipartite Crossing Numbers of Meshes -- Drawing Pfaffian Graphs -- 3D Visualization of Semantic Metadata Models and Ontologies -- A Note on the Self-similarity of Some Orthogonal Drawings -- No-Three-in-Line-in-3D -- Visual Navigation of Compound Graphs -- Layout Volumes of the Hypercube -- New Theoretical Bounds of Visibility Representation of Plane Graphs -- Software Demonstrations -- Visualizing Large Graphs with Compound-Fisheye Views and Treemaps -- A Compound Graph Layout Algorithm for Biological Pathways -- Curvilinear Graph Drawing Using the Force-Directed Method -- Graphael: A System for Generalized Force-Directed Layouts -- QUOGGLES: Query On Graphs - A Graphical Largely Extensible System -- Visualisation of Large and Complex Networks Using PolyPlane -- The Metro Map Layout Problem -- An Interactive Multi-user System for Simultaneous Graph Drawing -- Posters -- Gravisto: Graph Visualization Toolkit -- DNA Secondary Structures for Probe Design -- Open Problems Wiki -- Visualization and ILOG CPLEX -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Invited Talk -- Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. | |
| 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 |
_aPach, Janos. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9125559 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9125560 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540245285 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540807599 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v3383 _9125561 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/b105810 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c90993 _d90993 |
||