Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • 1
    UID:
    gbv_355616661
    Format: XIII, 384 S. , graph. Darst. , 24 cm
    ISBN: 3540001581
    Series Statement: Lecture notes in computer science 2528
    Additional Edition: Erscheint auch als Online-Ausgabe Goodrich, Michael T., 1961 - Graph Drawing Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 2002 ISBN 9783540361510
    Additional Edition: ISBN 3540001581
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphenzeichnen ; Graphenzeichnen ; Konferenzschrift ; Kongress
    URL: Cover
    Author information: Goodrich, Michael T. 1961-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    almahu_9947920811502882
    Format: XIV, 398 p. , online resource.
    ISBN: 9783540361510
    Series Statement: Lecture Notes in Computer Science, 2528
    Note: 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
    Additional Edition: Printed edition: ISBN 9783540001584
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almahu_9948621369902882
    Format: XIV, 398 p. , online resource.
    Edition: 1st ed. 2002.
    ISBN: 9783540361510
    Series Statement: Lecture Notes in Computer Science, 2528
    Note: 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 Nature eBook
    Additional Edition: Printed edition: ISBN 9783662170953
    Additional Edition: Printed edition: ISBN 9783540001584
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    gbv_1649187718
    Format: Online-Ressource
    ISBN: 9783540361510 , 3540001581
    Series Statement: Lecture Notes in Computer Science 2528
    Content: This book constitutes the thoroughly refereed post-proceedings of the 10th International Symposium on Graph Drawing, GD 2002, held in Irvine, CA, USA, in August 2002.The 24 revised full papers, 9 short papers, and 7 software demonstrations presented together with a report on the GD 2002 graph drawing contest were carefully reviewed and selected from a total of 48 regular paper submissions. All current aspects of graph drawing are addressed
    Additional Edition: ISBN 9783540001584
    Additional Edition: Buchausg. u.d.T. Graph drawing Berlin : Springer, 2002 ISBN 3540001581
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Graphenzeichnen ; Graphenzeichnen ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Author information: Goodrich, Michael T. 1961-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9783540001614?
Did you mean 9783540001164?
Did you mean 9783540001683?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages