Graph Drawing
Springer Berlin (Verlag)
978-3-540-00158-4 (ISBN)
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 ofPlanar 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.
Erscheint lt. Verlag | 30.10.2002 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XIV, 398 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 576 g |
Themenwelt | Mathematik / Informatik ► Informatik |
Mathematik / Informatik ► Mathematik ► Computerprogramme / Computeralgebra | |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
Schlagworte | 3D • Algorithm analysis and problem complexity • Algorithmic Graph Theory • algorithms • Complexity • Computational Graph Theory • Diagram Design • Graph • Graph Algorithms • Graph Computations • Graph Design • Graph Drawing • Graph Drawing Systems • Graph Editing • Graph Layout • Graph Representation • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Information Visualization • Optimization • SiM • Visualization |
ISBN-10 | 3-540-00158-1 / 3540001581 |
ISBN-13 | 978-3-540-00158-4 / 9783540001584 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich