Graph drawing : 10th international symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002 : revised papers
Сохранить в:
| Соавтор: | |
|---|---|
| Другие авторы: | , |
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Серии: | Lecture notes in computer science
2528 |
| Предметы: | |
| Online-ссылка: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Примечание: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graph drawing, 10th international symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, revised papers, Michael T. Goodrich, Stephen G. Kobourov (eds), 2002, Berlin, Springer, 1 vol. (XIII-384 p.), Lecture notes in computer science, 3-540-00158-1 • Graph Drawing, Texte imprimé, 9783662170953 |
Оглавление:
- 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.