Mutzel / Jünger / Leipert | Graph Drawing | E-Book | sack.de
E-Book

E-Book, Englisch, Band 2265, 528 Seiten, eBook

Reihe: Lecture Notes in Computer Science

Mutzel / Jünger / Leipert Graph Drawing

9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers
2002
ISBN: 978-3-540-45848-7
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

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

E-Book, Englisch, Band 2265, 528 Seiten, eBook

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-45848-7
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark



Mutzel / Jünger / Leipert 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.