Graph Drawing 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Hong, Seok-Hee (Επιμελητής έκδοσης), Nishizeki, Takao (Επιμελητής έκδοσης), Quan, Wu (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2008.
Σειρά:Lecture Notes in Computer Science, 4875
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04175nam a22005535i 4500
001 978-3-540-77537-9
003 DE-He213
005 20151204171652.0
007 cr nn 008mamaa
008 100301s2008 gw | s |||| 0|eng d
020 |a 9783540775379  |9 978-3-540-77537-9 
024 7 |a 10.1007/978-3-540-77537-9  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.M35 
072 7 |a PBD  |2 bicssc 
072 7 |a UYAM  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a MAT008000  |2 bisacsh 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Graph Drawing  |h [electronic resource] :  |b 15th International Symposium, GD 2007, Sydney, Australia, September 24-26, 2007. Revised Papers /  |c edited by Seok-Hee Hong, Takao Nishizeki, Wu Quan. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2008. 
300 |a XIII, 401 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4875 
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 -- 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 -- 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. 
650 0 |a Computer science. 
650 0 |a Data structures (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Computer graphics. 
650 1 4 |a Computer Science. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Computer Graphics. 
650 2 4 |a Data Structures. 
700 1 |a Hong, Seok-Hee.  |e editor. 
700 1 |a Nishizeki, Takao.  |e editor. 
700 1 |a Quan, Wu.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540775362 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 4875 
856 4 0 |u http://dx.doi.org/10.1007/978-3-540-77537-9  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)