|
|
|
|
| LEADER |
03572nmm a2200385 u 4500 |
| 001 |
EB000380089 |
| 003 |
EBX01000000000000000233141 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
130626 ||| eng |
| 020 |
|
|
|a 9783540775379
|
| 100 |
1 |
|
|a Hong, Seok-Hee
|e [editor]
|
| 245 |
0 |
0 |
|a Graph Drawing
|h Elektronische Ressource
|b 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007, Revised Papers
|c edited by Seok-Hee Hong, Takao Nishizeki, Wu Quan
|
| 250 |
|
|
|a 1st ed. 2008
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2008, 2008
|
| 300 |
|
|
|a XIII, 401 p
|b online resource
|
| 505 |
0 |
|
|a LunarVis – Analytic Visualizations of Large Graphs -- Visualizing Internet Evolution on the Autonomous Systems Level -- Treemaps for Directed Acyclic Graphs -- Drawing Graphs with GLEE -- Graph Drawing Contest -- Graph Drawing Contest Report
|
| 505 |
0 |
|
|a Invited Talks -- Computing Symmetries of Combinatorial Objects -- Large-Scale Graphics: Digital Nature and Laser Projection -- Papers -- Crossing Number of Graphs with Rotation Systems -- A Bipartite Strengthening of the Crossing Lemma -- Improvement on the Decay of Crossing Numbers -- Crossing Numbers and Parameterized Complexity -- Characterization of Unlabeled Level Planar Graphs -- Cyclic Level Planarity Testing and Embedding -- Practical Level Planarity Testing and Layout with Embedding Constraints -- Minimum Level Nonplanar Patterns for Trees -- Straight-Line Orthogonal Drawings of Binary and Ternary Trees -- Polynomial Area Bounds for MST Embeddings of Trees -- Moving Vertices to Make Drawings Plane -- Point-Set Embedding of Trees with Edge Constraints -- Representation of Planar Hypergraphs by Contacts of Triangles -- The Complexity of Several Realizability Problems for Abstract Topological Graphs -- Efficient Extraction of Multiple Kuratowski Subdivisions --
|
| 505 |
0 |
|
|a Cover Contact Graphs -- Matched Drawings of Planar Graphs -- Maximum Upward Planar Subgraphs of Embedded Planar Digraphs -- Minimizing the Area for Planar Straight-Line Grid Drawings -- On Planar Polyline Drawings -- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection -- Line Crossing Minimization on Metro Maps -- Algorithms for Multi-criteria One-Sided Boundary Labeling -- Multi-circular Layout of Micro/Macro Graphs -- Constrained Simultaneous and Near-Simultaneous Embeddings -- Simultaneous Geometric Graph Embeddings -- Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces -- Clustered Planarity: Small Clusters in Eulerian Graphs -- Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge -- Colorability in Orthogonal Graph Drawing -- A Note on Minimum-Area Straight-Line Drawings of Planar Graphs -- Universal Sets of n Points for 1-Bend Drawings of Planar Graphs with n Vertices --
|
| 653 |
|
|
|a Artificial intelligence / Data processing
|
| 653 |
|
|
|a Computer graphics
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Computer Graphics
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Data Science
|
| 700 |
1 |
|
|a Nishizeki, Takao
|e [editor]
|
| 700 |
1 |
|
|a Quan, Wu
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a Theoretical Computer Science and General Issues
|
| 028 |
5 |
0 |
|a 10.1007/978-3-540-77537-9
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-540-77537-9?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|