|
|
|
|
LEADER |
05610nam a2200577 4500 |
001 |
978-3-540-45848-7 |
003 |
DE-He213 |
005 |
20191027133328.0 |
007 |
cr nn 008mamaa |
008 |
121227s2002 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540458487
|9 978-3-540-45848-7
|
024 |
7 |
|
|a 10.1007/3-540-45848-4
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA76.75-76.765
|
072 |
|
7 |
|a UFM
|2 bicssc
|
072 |
|
7 |
|a COM077000
|2 bisacsh
|
072 |
|
7 |
|a UFM
|2 thema
|
082 |
0 |
4 |
|a 004
|2 23
|
245 |
1 |
0 |
|a Graph Drawing
|h [electronic resource] :
|b 9th International Symposium, GD 2001 Vienna, Austria, September 23-26, 2001, Revised Papers /
|c edited by Petra Mutzel, Michael Jünger, Sebastian Leipert.
|
250 |
|
|
|a 1st ed. 2002.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2002.
|
300 |
|
|
|a XVI, 528 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2265
|
505 |
0 |
|
|a 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 -- Corrected Printing 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.
|
650 |
|
0 |
|a Computer software.
|
650 |
|
0 |
|a Engineering design.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
|
0 |
|a Computer graphics.
|
650 |
|
0 |
|a Algorithms.
|
650 |
1 |
4 |
|a Mathematical Software.
|0 http://scigraph.springernature.com/things/product-market-codes/M14042
|
650 |
2 |
4 |
|a Engineering Design.
|0 http://scigraph.springernature.com/things/product-market-codes/T17020
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|0 http://scigraph.springernature.com/things/product-market-codes/I17028
|
650 |
2 |
4 |
|a Computer Graphics.
|0 http://scigraph.springernature.com/things/product-market-codes/I22013
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 http://scigraph.springernature.com/things/product-market-codes/I16021
|
700 |
1 |
|
|a Mutzel, Petra.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Jünger, Michael.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Leipert, Sebastian.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783662191217
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540433095
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2265
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-45848-4
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|