000 06215nam a22006735i 4500
001 978-3-642-00219-9
003 DE-He213
005 20240730182002.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 _a9783642002199
_9978-3-642-00219-9
024 7 _a10.1007/978-3-642-00219-9
_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] :
_b16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers /
_cedited by Ioannis G. Tollis, Maurizio Patrignani.
250 _a1st ed. 2009.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2009.
300 _aXIV, 460 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 ;
_v5417
505 0 _aInvited Talks -- Networks in Biology - From Identification, Analysis to Interpretation -- Graph Drawing for Security Visualization -- Papers -- Succinct Greedy Graph Drawing in the Hyperbolic Plane -- An Algorithm to Construct Greedy Drawings of Triangulations -- Crossing and Weighted Crossing Number of Near-Planar Graphs -- Cubic Graphs Have Bounded Slope Parameter -- Unimaximal Sequences of Pairs in Rectangle Visibility Drawing -- Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights -- The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing -- Rapid Multipole Graph Drawing on the GPU -- Clustered Planarity: Clusters with Few Outgoing Edges -- Computing Maximum C-Planar Subgraphs -- Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters -- Visual Analysis of One-to-Many Matched Graphs -- Topological Morphing of Planar Graphs -- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges -- Graph Simultaneous Embedding Tool, GraphSET -- Hamiltonian Alternating Paths on Bicolored Double-Chains -- The Binary Stress Model for Graph Drawing -- Efficient Node Overlap Removal Using a Proximity Stress Model -- An Experimental Study on Distance-Based Graph Drawing -- Topology Preserving Constrained Graph Layout -- Embeddability Problems for Upward Planar Digraphs -- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs -- On the Hardness of Orthogonal-Order Preserving Graph Drawing -- Generalizing the Shift Method for Rectangular Shaped Vertices with Visibility Constraints -- Placing Text Boxes on Graphs -- Removing Node Overlaps Using Multi-sphere Scheme -- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing -- Connected Rectilinear Graphs on PointSets -- 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces -- Drawing (Complete) Binary Tanglegrams -- Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem -- Cyclic Leveling of Directed Graphs -- Constrained Point-Set Embeddability of Planar Graphs -- Tree Drawings on the Hexagonal Grid -- Isometric Diamond Subgraphs -- Non-convex Representations of Graphs -- Subdivision Drawings of Hypergraphs -- Minimum Segment Drawings of Series-Parallel Graphs with the Maximum Degree Three -- Dunnart: A Constraint-Based Network Diagram Authoring Tool -- Posters -- Approximating the Crossing Number of Apex Graphs -- Policy-Aware Visualization of Internet Dynamics -- Enhancing Visualizations of Business Processes -- A Robust Biclustering Method Based on Crossing Minimization in Bipartite Graphs -- Visualizing the Results of Metabolic Pathway Queries -- Visual Specification of Layout -- Spine Crossing Minimization in Upward Topological Book Embeddings -- ILOG Elixir -- DAGmap View -- Brain Network Analyzer -- Graph Drawing Contest -- Graph Drawing Contest Report.
520 _aThis book constitutes the proceedings of the 16th International Symposium on Graph Drawing, GD 2008, held in Heraklion, Crete, Greece, during September 21-24, 2008. The 31 long papers and 8 short papers presented together with 10 posters and two invited papers were carefully reviewed and selected from 83 submissions. The volume also includes a report on the Graph Drawing Contest which was held during the conference. An important aspect of the conference is bridging the gap between theoretical advances and implemented solutions of geometric representation of graphs and networks. It is motivated by those applications where it is crucial to visualize structural information as graphs.
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aApplication software.
_9126856
650 0 _aComputer science.
_99832
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 _aComputer and Information Systems Applications.
_9126857
650 2 4 _aTheory of Computation.
_9126858
650 2 4 _aAlgorithms.
_93390
650 2 4 _aComputer Graphics.
_94088
650 2 4 _aData Science.
_934092
700 1 _aTollis, Ioannis G.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9126859
700 1 _aPatrignani, Maurizio.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9126860
710 2 _aSpringerLink (Online service)
_9126861
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783642002182
776 0 8 _iPrinted edition:
_z9783642002205
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v5417
_9126862
856 4 0 _uhttps://doi.org/10.1007/978-3-642-00219-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c91172
_d91172