



LEADER 
05048nmm a2200385 u 4500 
001 
EB001884448 
003 
EBX01000000000000001047815 
005 
00000000000000.0 
007 
cr 
008 
191115  eng 
020 


a 9783540466482

100 
1 

a Kratochvil, Jan
e [editor]

245 
0 
0 
a Graph Drawing
h Elektronische Ressource
b 7th International Symposium, GD'99, Stirin Castle, Czech Republic, September 1519, 1999 Proceedings
c edited by Jan Kratochvil

250 


a 1st ed. 1999

260 


a Berlin, Heidelberg
b Springer Berlin Heidelberg
c 1999, 1999

300 


a XIV, 426 p
b online resource

505 
0 

a Invited Talk  The Anatomy of a Geometric Algorithm  Orthogonality I  TurnRegularity and Planar Orthogonal Drawings  Combining Graph Labeling and Compaction  Almost BendOptimal Planar Orthogonal Drawings of Biconnected Degree3 Planar Graphs in Quadratic Time  Fully Dynamic 3Dimensional Orthogonal Graph Drawing  Levels I  An E log E Line Crossing Algorithm for Levelled Graphs  Level Planar Embedding in Linear Time  Higres — Visualization System for Clustered Graphs and Graph Algorithms  Clusters I  Partitioning Approach to Visualization of Large Graphs  Graph Clustering Using Distancek Cliques  Drawing I  A Framework for Circular Drawings of Networks  Drawing Planar Graphs with Circular Arcs  Drawing Graphs in the Hyperbolic Plane  Invited Talk  Graph Planarity and Related Topics  Planarity  Grid Drawings of FourConnected Plane Graphs  Graph Embedding with Topological CycleConstraints 

505 
0 

a Embedding Vertices at Points: Few Bends Suffice for Planar Graphs  The Constrained Crossing Minimization Problem  Clusters II  PlanarityPreserving Clustering and Embedding for Large Planar Graphs  An Algorithm for Drawing Compound Graphs  Levels II  The VertexExchange Graph: A New Concept for Multilevel Crossing Minimisation  Using Sifting for kLayer Straightline Crossing Minimization  On 3Layer Crossings and Pseudo Arrangements  Applications  Visualizing Algorithms for the Design and Analysis of Survivable Networks  LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation  Centrality in Policy Network Drawings  StraightLine Drawings of Protein Interactions  Invited Talk  Art of Drawing  Symmetry  An Heuristic for Graph Symmetry Detection  Isomorphic Subgraphs  Orthogonality II  Orthogonal and QuasiupwardDrawings with Vertices of Prescribed Size  Multidimensional Orthogonal Graph Drawing with Small Boxes 

505 
0 

a Representations  Geometric Realization of Simplicial Complexes  Visibility Representations of Complete Graphs  TriangleFree Planar Graphs as Segments Intersection Graphs  Drawing II  A ForceDirected Algorithm that Preserves Edge Crossing Properties  Proximity and Trees  Rectangle of Influence Drawings of Graphs without Filled 3Cycles  Voronoi Drawings of Trees  Infinite Trees and the Future  Latour — A Tree Visualisation System  Graph Drawing Contest  GraphDrawing Contest Report  Hunting Down Graph B  Posters  Orthogonal and StraightLine Drawings of Graphs with Succinct Representations  Electronic Biochemical Pathways

653 


a Computer graphics

653 


a Computer science / Mathematics

653 


a Discrete Mathematics in Computer Science

653 


a Computer Graphics

653 


a Algorithms

653 


a Application software

653 


a Discrete Mathematics

653 


a Discrete mathematics

653 


a Computer and Information Systems Applications

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/3540466487

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

082 
0 

a 005.3

520 


a The range of issues considered in graph drawing includes algorithms, graph theory, geometry, topology, order theory, graphic languages, perception, app cations, and practical systems. Much research is motivated by applications to systems for viewing and interacting with graphs. The interaction between th retical advances and implemented solutions is an important part of the graph drawing eld. The annually organized graph drawing symposium is a forum for researchers, practitioners, developers, and users working on all aspects of graph visualization and representations. The preceding symposia were held in M treal (GD’98), Rome (GD’97), Berkeley (GD’96), Passau (GD’95), Princeton (GD’94), and Paris (GD’93). The Seventh International Symposium on Graph Drawing GD’99 was or nized at Sti r n Castle, in the vicinity of Prague, Czech Republic. This baroque castle recently restored as a hotel and conference center provided a secluded place for the participants, who made good use of the working atmosphere of the conference. In total the symposium had 83 registered participants from 16 countries
