FEEDBACK Smiley face
Normal view MARC view ISBD view

Graph Drawing [electronic resource] :10th International Symposium, GD 2002 Irvine, CA, USA, August 26–28, 2002 Revised Papers /

Contributor(s): Goodrich, Michael T [editor.] | Kobourov, Stephen G [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 2528Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002.Description: XIV, 398 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540361510.Subject(s): Mathematics | Algorithms | Computer science -- Mathematics | Computer graphics | Computer software | Mathematics | Mathematical Software | Discrete Mathematics in Computer Science | Algorithm Analysis and Problem Complexity | Computer GraphicsOnline resources: Click here to access online
Contents:
Papers -- Sketch-Driven Orthogonal Graph Drawing -- Maintaining the Mental Map for Circular Drawings -- Graphs, They Are Changing -- Drawing Graphs on Two and Three Lines -- Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs -- Drawing Outer-Planar Graphs in O(n log n )Area -- Computing Labeled Orthogonal Drawings -- Computing and Drawing Isomorphic Subgraphs -- A Group-Theoretic Method for Drawing Graphs Symmetrically -- A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem -- Geometric Systems of Disjoint Representatives -- An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization -- Simple and Efficient Bilayer Cross Counting -- Orthogonal 3D Shapes of Theta Graphs -- Separating Thickness from Geometric Thickness -- Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs -- Compact Encodings of Planar Orthogonal Drawings -- Fractional Lengths and Crossing Numbers -- Drawing Directed Graphs Using One-Dimensional Optimization -- Graph Drawing by High-Dimensional Embedding -- Advances in C-Planarity Testing of Clustered Graphs -- HGV: A Library for Hierarchies, Graphs, and Views -- Rectangular Drawings of Planar Graphs -- Extended Rectangular Drawings of Plane Graphs with Designated Corners -- RINGS: A Technique for Visualizing Large Hierarchies -- Applying Crossing Reduction Strategies to Layered Compound Graphs -- Crossing Reduction by Windows Optimization -- Geometric Graphs with No Self-intersecting Path of Length Three -- Two New Heuristics for Two-Sided Bipartite Graph Drawing -- Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio -- Some Applications of Orderly Spanning Trees in Graph Drawing -- Improving Walker’s Algorithm to Run in Linear Time -- Semi-dynamic Orthogonal Drawings of Planar Graphs -- Software Demonstrations -- Graph Layout for Workflow Applications with ILOG JViews -- InterViewer: Dynamic Visualization of Protein-Protein Interactions -- Some Modifications of Sugiyama Approach -- A Framework for Complexity Management in Graph Visualization -- A Partitioned Approach to Protein Interaction Mapping -- Camera Position Reconstruction and Tight Direction Networks -- Demonstration of a Preprocessor for the Spring Embedder -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Invited Talks -- Techniques for Interactive Graph Drawing -- Drawing Venn Diagrams.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Papers -- Sketch-Driven Orthogonal Graph Drawing -- Maintaining the Mental Map for Circular Drawings -- Graphs, They Are Changing -- Drawing Graphs on Two and Three Lines -- Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs -- Drawing Outer-Planar Graphs in O(n log n )Area -- Computing Labeled Orthogonal Drawings -- Computing and Drawing Isomorphic Subgraphs -- A Group-Theoretic Method for Drawing Graphs Symmetrically -- A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem -- Geometric Systems of Disjoint Representatives -- An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization -- Simple and Efficient Bilayer Cross Counting -- Orthogonal 3D Shapes of Theta Graphs -- Separating Thickness from Geometric Thickness -- Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs -- Compact Encodings of Planar Orthogonal Drawings -- Fractional Lengths and Crossing Numbers -- Drawing Directed Graphs Using One-Dimensional Optimization -- Graph Drawing by High-Dimensional Embedding -- Advances in C-Planarity Testing of Clustered Graphs -- HGV: A Library for Hierarchies, Graphs, and Views -- Rectangular Drawings of Planar Graphs -- Extended Rectangular Drawings of Plane Graphs with Designated Corners -- RINGS: A Technique for Visualizing Large Hierarchies -- Applying Crossing Reduction Strategies to Layered Compound Graphs -- Crossing Reduction by Windows Optimization -- Geometric Graphs with No Self-intersecting Path of Length Three -- Two New Heuristics for Two-Sided Bipartite Graph Drawing -- Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio -- Some Applications of Orderly Spanning Trees in Graph Drawing -- Improving Walker’s Algorithm to Run in Linear Time -- Semi-dynamic Orthogonal Drawings of Planar Graphs -- Software Demonstrations -- Graph Layout for Workflow Applications with ILOG JViews -- InterViewer: Dynamic Visualization of Protein-Protein Interactions -- Some Modifications of Sugiyama Approach -- A Framework for Complexity Management in Graph Visualization -- A Partitioned Approach to Protein Interaction Mapping -- Camera Position Reconstruction and Tight Direction Networks -- Demonstration of a Preprocessor for the Spring Embedder -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Invited Talks -- Techniques for Interactive Graph Drawing -- Drawing Venn Diagrams.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in