Jiří Matoušek (auth.), Jan Kratochvíyl (eds.)9783540669043, 3540669043
The 38 revised full papers presented together with three invited contributions, two posters, and a report on the graph drawing contest were carefully reviewed and selected from 59 submissions. Among the topics addressed are orthogonality, levels, clusters, drawing, planarity, applications, symmetry, representations, and proximity and trees.
Table of contents :
Content:
Front Matter….Pages I-XIII
The Anatomy of a Geometric Algorithm….Pages 1-7
Turn-Regularity and Planar Orthogonal Drawings….Pages 8-26
Combining Graph Labeling and Compaction….Pages 27-37
Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time….Pages 38-48
Fully Dynamic 3-Dimensional Orthogonal Graph Drawing….Pages 49-58
An E log E Line Crossing Algorithm for Levelled Graphs….Pages 59-71
Level Planar Embedding in Linear Time….Pages 72-81
Higres — Visualization System for Clustered Graphs and Graph Algorithms….Pages 82-89
Partitioning Approach to Visualization of Large Graphs….Pages 90-97
Graph Clustering Using Distance-k Cliques….Pages 98-106
A Framework for Circular Drawings of Networks….Pages 107-116
Drawing Planar Graphs with Circular Arcs….Pages 117-126
Drawing Graphs in the Hyperbolic Plane….Pages 127-136
Graph Planarity and Related Topics….Pages 137-144
Grid Drawings of Four-Connected Plane Graphs….Pages 145-154
Graph Embedding with Topological Cycle-Constraints….Pages 155-164
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs….Pages 165-174
The Constrained Crossing Minimization Problem….Pages 175-185
Planarity-Preserving Clustering and Embedding for Large Planar Graphs….Pages 186-196
An Algorithm for Drawing Compound Graphs….Pages 197-204
The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation….Pages 205-216
Using Sifting for k-Layer Straightline Crossing Minimization….Pages 217-224
On 3-Layer Crossings and Pseudo Arrangements….Pages 225-231
Visualizing Algorithms for the Design and Analysis of Survivable Networks….Pages 232-241
LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation….Pages 242-249
Centrality in Policy Network Drawings….Pages 250-258
Straight-Line Drawings of Protein Interactions….Pages 259-266
Art of Drawing….Pages 267-275
An Heuristic for Graph Symmetry Detection….Pages 276-285
Isomorphic Subgraphs….Pages 286-296
Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size….Pages 297-310
Multi-dimensional Orthogonal Graph Drawing with Small Boxes….Pages 311-322
Geometric Realization of Simplicial Complexes….Pages 323-332
Visibility Representations of Complete Graphs….Pages 333-340
Triangle-Free Planar Graphs as Segments Intersection Graphs….Pages 341-350
A Force-Directed Algorithm that Preserves Edge Crossing Properties….Pages 351-358
Rectangle of Influence Drawings of Graphs without Filled 3-Cycles….Pages 359-368
Voronoi Drawings of Trees….Pages 369-378
Infinite Trees and the Future….Pages 379-391
Latour — A Tree Visualisation System….Pages 392-399
Graph-Drawing Contest Report….Pages 400-409
Hunting Down Graph B….Pages 410-415
Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations….Pages 416-417
Electronic Biochemical Pathways….Pages 418-419
Back Matter….Pages 421-422
Reviews
There are no reviews yet.