



LEADER 
05151nmm a2200385 u 4500 
001 
EB001884364 
003 
EBX01000000000000001047731 
005 
00000000000000.0 
007 
cr 
008 
191115  eng 
020 


a 9783540445418

100 
1 

a Marks, Joe
e [editor]

245 
0 
0 
a Graph Drawing
h Elektronische Ressource
b 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 2023, 2000, Proceedings
c edited by Joe Marks

250 


a 1st ed. 2001

260 


a Berlin, Heidelberg
b Springer Berlin Heidelberg
c 2001, 2001

300 


a XII, 422 p
b online resource

505 
0 

a A Multilevel Algorithm for ForceDirected Graph Drawing  A Fast Multiscale Method for Drawing Large Graphs  FADE: Graph Drawing, Clustering, and Visual Abstraction  A Multidimensional Approach to ForceDirected Layouts of Large Graphs  GRIP: Graph dRawing with Intelligent Placement  kLevel Graph Layout  A Fast Layout Algorithm for kLevel Graphs  Graph Layout for Displaying Data Structures  kLayer Straightline Crossing Minimization by Speeding Up Sifting  Orthogonal Drawing I  Lower Bounds for the Number of Bends in ThreeDimensional Orthogonal Graph Drawings  Orthogonal Drawings of Cycles in 3D Space  ThreeDimensional Orthogonal Graph Drawing with Optimal Volume  Orthogonal Drawing II  A LinearTime Algorithm for BendOptimal Orthogonal Drawings of Biconnected Cubic Plane Graphs  Refinement ofThreeDimensional Orthogonal Graph Drawings  Theory II  ?Searchlight Obedient Graph Drawings 

505 
0 

a 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 XMLBased Graph Description Format  Theory I  On Polar Visibility Representations of Graphs  A Linear Time Implementation of SPQRTrees  Labeling Points with Rectangles of Various Shapes  How to Draw the Minimum Cuts of a Planar Graph  Applications and Systems  2DStructure 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  ForceDirected Layout 

505 
0 

a Unavoidable Configurations in Complete Topological Graphs  Minimum Weight Drawings of Maximal Triangulations  A Layout Algorithm for BarVisibility Graphs on the Möbius Band  Symmetry and Incremental Layout  An Algorithm for Finding Three Dimensional Symmetry in Trees  On Maximum Symmetric Subgraphs  ClanBased Incremental Drawing  The Marey Graph Animation Tool Demo  Workshop and Contest  Graph Data Format Workshop Report  GraphDrawing Contest Report

653 


a Computer graphics

653 


a Computer science

653 


a Computer science / Mathematics

653 


a Discrete Mathematics in Computer Science

653 


a Computer Graphics

653 


a Algorithms

653 


a Discrete Mathematics

653 


a Discrete mathematics

653 


a Theory of Computation

041 
0 
7 
a eng
2 ISO 6392

989 


b SBA
a Springer Book Archives 2004

490 
0 

a Lecture Notes in Computer Science

028 
5 
0 
a 10.1007/3540445412

856 
4 
0 
u https://doi.org/10.1007/3540445412?nosfx=y
x Verlag
3 Volltext

082 
0 

a 518.1

520 


a 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 in the eld of graph drawing. As in previous years, the review process was quite competitive. We accepted 30 out of 53 regularlength submissions, and 5 out of 15 short submissions, for a total acceptance ratio of 35 out of 68, or 51%. This year’s program featured several new developments in the eld. Four di erent approaches for handling very large graphs were presented in a session on forcedirected layout. Two sessions were devoted to the latest advances in orthogonal graph drawing. And alongside the usual mix of theory and practice papers we had several contributions based on empirical studies of users and of systems. Our invited talks were given by two speakers who were new to most members of the GD community, but who work in areas that are closely related to graph drawing. Professor Colin Ware of the University of New Hampshire told us how knowledge of human visual perception is useful for the design of e ective data visualizations. And Professor David Jensen of the University of Massachusetts at Amherst talked about the process of knowledge discovery from graphs, a process that involves more than just graph drawing and visualization
