Graph Drawing 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Marks, Joe (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 1984
• Θέματα: Algorithms.; Discrete mathematics.; Computers.; Computer graphics.; Computer science-Mathematics.; Combinatorics.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics.; Theory of Computation.; Computer Graphics.; Discrete Mathematics in Computer Science.

This year's meeting marked the Eighth International Symposium on Graph D- wing. The organizing and program committees worked hard to make this year's symposium possible, and we were delighted that so many people came to - lonial Williamsburg, Virginia, for three days of the latest results...

Πίνακας περιεχομένων:

• Invited Talk
• The Visual Representation of Information Structures
• Empirical Studies and Standards
• User Preference of Graph Layout Aesthetics: A UML Study
• A User Study in Similarity Measures for Graph Drawing
• Interactive Partitioning System Demonstration, Short
• An Experimental Comparison of Orthogonal Compaction Algorithms
• GraphXML - An XML-Based Graph Description Format
• Theory I
• On Polar Visibility Representations of Graphs
• A Linear Time Implementation of SPQR-Trees
• Labeling Points with Rectangles of Various Shapes
• How to Draw the Minimum Cuts of a Planar Graph
• Applications and Systems
• 2D-Structure Drawings of Similar Molecules
• Fast Layout Methods for Timetable Graphs
• An Algorithmic Framework for Visualizing Statecharts
• Visualization of the Autonomous Systems Interconnections with Hermes
• Drawing Hypergraphs in the Subset Standard (Short Demo Paper)
• Invited Talk
• Knowledge Discovery from Graphs
• Force-Directed Layout
• A Multilevel Algorithm for Force-Directed Graph Drawing
• A Fast Multi-scale Method for Drawing Large Graphs
• FADE: Graph Drawing, Clustering, and Visual Abstraction
• A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
• GRIP: Graph dRawing with Intelligent Placement
• k-Level Graph Layout
• A Fast Layout Algorithm for k-Level Graphs
• Graph Layout for Displaying Data Structures
• k-Layer Straightline Crossing Minimization by Speeding Up Sifting
• Orthogonal Drawing I
• Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
• Orthogonal Drawings of Cycles in 3D Space
• Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
• Orthogonal Drawing II
• A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs
• Refinement of Three-Dimensional Orthogonal Graph Drawings
• Theory II
• ?-Searchlight Obedient Graph Drawings
• Unavoidable Configurations in Complete Topological Graphs
• Minimum Weight Drawings of Maximal Triangulations
• A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band
• Symmetry and Incremental Layout
• An Algorithm for Finding Three Dimensional Symmetry in Trees
• On Maximum Symmetric Subgraphs
• Clan-Based Incremental Drawing
• The Marey Graph Animation Tool Demo
• Workshop and Contest
• Graph Data Format Workshop Report
• Graph-Drawing Contest Report.