Graph Drawing
Editat de Stephen G. Kobourov, Michael T. Goodrichen Limba Engleză Paperback – 30 oct 2002
Preț: 326.91 lei
Preț vechi: 408.64 lei
-20% Nou
Puncte Express: 490
Preț estimativ în valută:
57.85€ • 67.83$ • 50.80£
57.85€ • 67.83$ • 50.80£
Carte tipărită la comandă
Livrare economică 04-18 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540001584
ISBN-10: 3540001581
Pagini: 412
Ilustrații: XIV, 398 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540001581
Pagini: 412
Ilustrații: XIV, 398 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:2002
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Caracteristici
Includes supplementary material: sn.pub/extras