Mutzel / Leipert / Jünger | Graph Drawing | Buch | 978-3-540-43309-5 | sack.de

Buch, Englisch, Band 2265, 528 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1680 g

Reihe: Lecture Notes in Computer Science

Mutzel / Leipert / Jünger

Graph Drawing

9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers
2002
ISBN: 978-3-540-43309-5
Verlag: Springer Berlin Heidelberg

9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers

Buch, Englisch, Band 2265, 528 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1680 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-43309-5
Verlag: Springer Berlin Heidelberg


With 133 registered participants from 27 countries, including 19 participants fromindustry,theInternationalSymposiumonGraphDrawing2001(GD2001) that took place in Vienna, September 23–26, 2001, clearly demonstrated that the graph drawing community is still growing. The 31 contributed talks that hadbeenselectedoutof66papersubmissionsbytheprogramcommitteere?ect themanyfacetsofgraphdrawingandthehighactivityinourscienti?cdiscipline. In addition, we had the pleasure of enjoying invited presentations by Alexander Schrijver and Eduard Gr¨ oller that mark extreme points of the wide spectrum of graph drawing, the mathematical foundations and the computer graphics, respectively.Wehavecompiledthewrittenversionsofthesecontributionsinthe same order as they were presented during the conference. WehaveaddedacorrectversionofJoanP.Hutchinson’scontributiontoGD 2000 that had been misprinted in the GD 2000 proceedings. GD 2001 hosted a software exhibition that gave participants and guests the opportunity for hands-on experience with state-of-the-art graph drawing tools. Outofthe26submittedsoftwaretools,24werepresentedattheconferenceand received considerable attention by the participants. Each of them is represented here by a two-page-summary. Inaspecialsessionongraphexchangeformats,organizedbyGiuseppeLiotta, theGXLandtheGraphMLprojectswerepresentedbyAndreasWinterandUlrik Brandes,respectively,andthenalivelydiscussionfollowed.Thewrittenversions of the two reports are also included here. The ?nal contribution in this volume is a report on a traditional component of all graph drawing conferences that is a serious and a fun event at the same time: the Graph Drawing Contest 2001 organized by Franz Brandenburg. We would like to thank all contributors for the pleasant cooperation.

Mutzel / Leipert / Jünger Graph Drawing jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Hierarchical Drawing.- A Fixed-Parameter Approach to Two-Layer Planarization.- How to Layer a Directed Acyclic Graph.- Fast and Simple Horizontal Coordinate Assignment.- Automated Visualization of Process Diagrams.- Planarity.- Planarization of Clustered Graphs.- An Algorithm for Finding Large Induced Planar Subgraphs.- A Characterization of DFS Cotree Critical Graphs.- Crossing Theory.- An Improved Lower Bound for Crossing Numbers.- Crossing-Critical Graphs and Path-Width.- One Sided Crossing Minimization Is NP-Hard for Sparse Graphs.- Compaction.- Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size.- Labeling Heuristics for Orthogonal Drawings.- Planar Graphs.- Untangling a Polygon.- Drawing with Fat Edges.- Symmetries.- Detecting Symmetries by Branch & Cut.- Drawing Graphs Symmetrically in Three Dimensions.- Interactive Drawing.- User Hints for Directed Graph Drawing.- Graph Drawing in Motion II.- Online Hierarchical Graph Drawing.- Representations.- Recognizing String Graphs Is Decidable.- On Intersection Graphs of Segments with Prescribed Slopes.- Aesthetics.- A Short Note on the History of Graph Drawing.- Towards an Aesthetic Invariant for Graph Drawing.- 2D-and 3D-Embeddings.- Orthogonal Drawings with Few Layers.- Bounded Degree Book Embeddings and Three-Dimensional Orthogonal Graph Drawing.- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions.- Low-Distortion Embeddings of Trees.- Data Visualization.- Insight into Data through Visualization.- Floor-Planning.- Floor-Planning via Orderly Spanning Trees.- Disconnected Graph Layout and the Polyomino Packing Approach.- Planar Drawings.- Orthogonal Drawings of Plane Graphs without Bends.- Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution.- CorrectedPrinting of GD 2000 Paper.- On Polar Visibility Representations of Graphs.- Software Exhibition.- Tulip.- The ILOG JViews Graph Layout Module.- WAVE.- WilmaScope— An Interactive 3D Graph Visualisation System.- Exploration and Visualization of Computer Networks: Polyphemus and Hermes.- CrocoCosmos.- The Graph Drawing Server.- Drawing Database Schemas with DBdraw.- yFiles: Visualization and Automatic Layout of Graphs.- BioPath.- Graph Visualization API Library for Application Builders.- JGraph— A Java Based System for Drawing Graphs and Running Graph Algorithms.- Caesar Automatic Layout of UML Class Diagrams.- Visone Software for Visual Social Network Analysis.- Generating Schematic Cable Plans Using Springembedder Methods.- SugiBib.- Knowledge Index Manager.- Planarity Testing of Graphs on Base of a Spring Model.- AGD: A Library of Algorithms for Graph Drawing.- Industrial Plant Drawer.- Pajek— Analysis and Visualization of Large Networks.- GLIDE.- ViSta.- Graphviz— Open Source Graph Drawing Tools.- Graph Exchange Formats.- Exchanging Graphs with GXL.- GraphML Progress Report Structural Layer Proposal.- Graph Drawing Contest.- Graph-Drawing Contest Report.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.