Borrow it
Coverart for item
The Resource Graph drawing : 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008 : revised papers, Ioannis G. Tollis, Maurizio Patrignani (eds.)

Graph drawing : 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008 : revised papers, Ioannis G. Tollis, Maurizio Patrignani (eds.)

Creator
Contributor
Summary
This 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
Language
eng
Work
Publication
Extent
1 online resource (xiv, 460 pages)
Contents
  • Invited 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 Point Sets
  • 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
Isbn
9783642002199
Instance
Label
Graph drawing : 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008 : revised papers
Title
Graph drawing
Title remainder
16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008 : revised papers
Statement of responsibility
Ioannis G. Tollis, Maurizio Patrignani (eds.)
Title variation
GD 2008
Creator
Contributor
Subject
Genre
Language
eng
Summary
This 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
Member of
Cataloging source
GW5XE
Dewey number
006.6
Illustrations
illustrations
Index
index present
LC call number
T385
LC item number
.G73 2009
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2008
http://bibfra.me/vocab/lite/meetingName
GD (Symposium)
Nature of contents
  • dictionaries
  • bibliography
http://library.link/vocab/relatedWorkOrContributorDate
1958-
http://library.link/vocab/relatedWorkOrContributorName
  • Tollis, Ioannis G.
  • Patrignani, Maurizio
Series statement
Lecture notes in computer science,
Series volume
5417
http://library.link/vocab/subjectName
  • Computer graphics
  • Graph theory
  • Computer graphics
  • Graph theory
  • Informatique
  • Computer graphics
  • Graph theory
  • Computer Science
  • Discrete Mathematics in Computer Science
  • Computer Applications
  • Theory of Computation
  • Algorithm Analysis and Problem Complexity
  • Computer Graphics
  • Data Structures
Label
Graph drawing : 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008 : revised papers, Ioannis G. Tollis, Maurizio Patrignani (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Invited 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 Point Sets -- 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
Control code
318545528
Dimensions
unknown
Extent
1 online resource (xiv, 460 pages)
Form of item
online
Isbn
9783642002199
Lccn
2009920785
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 9786612000980
  • 10.1007/978-3-642-00219-9
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-00218-2
Specific material designation
remote
System control number
(OCoLC)318545528
Label
Graph drawing : 16th international symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008 : revised papers, Ioannis G. Tollis, Maurizio Patrignani (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Invited 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 Point Sets -- 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
Control code
318545528
Dimensions
unknown
Extent
1 online resource (xiv, 460 pages)
Form of item
online
Isbn
9783642002199
Lccn
2009920785
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
  • 9786612000980
  • 10.1007/978-3-642-00219-9
Other physical details
illustrations.
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-00218-2
Specific material designation
remote
System control number
(OCoLC)318545528

Subject

Genre

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...