Graph Drawing 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Kobourov, Stephen G. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Goodrich, Michael T. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
Έκδοση:1st ed. 2002.
Σειρά:Lecture Notes in Computer Science, 2528
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04750nam a22005415i 4500
001 978-3-540-36151-0
003 DE-He213
005 20191028181852.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 |a 9783540361510  |9 978-3-540-36151-0 
024 7 |a 10.1007/3-540-36151-0  |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 10th International Symposium, GD 2002, Irvine, CA, USA, August 26-28, 2002, Revised Papers /  |c edited by Stephen G. Kobourov, Michael T. Goodrich. 
250 |a 1st ed. 2002. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2002. 
300 |a XIV, 398 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 2528 
505 0 |a Papers -- Sketch-Driven Orthogonal Graph Drawing -- Maintaining the Mental Map for Circular Drawings -- Graphs, They Are Changing -- Drawing Graphs on Two and Three Lines -- Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs -- Drawing Outer-Planar Graphs in O(n log n )Area -- Computing Labeled Orthogonal Drawings -- Computing and Drawing Isomorphic Subgraphs -- A Group-Theoretic Method for Drawing Graphs Symmetrically -- A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem -- Geometric Systems of Disjoint Representatives -- An Efficient Fixed Parameter Tractable Algorithm for 1-Sided Crossing Minimization -- Simple and Efficient Bilayer Cross Counting -- Orthogonal 3D Shapes of Theta Graphs -- Separating Thickness from Geometric Thickness -- Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs -- Compact Encodings of Planar Orthogonal Drawings -- Fractional Lengths and Crossing Numbers -- Drawing Directed Graphs Using One-Dimensional Optimization -- Graph Drawing by High-Dimensional Embedding -- Advances in C-Planarity Testing of Clustered Graphs -- HGV: A Library for Hierarchies, Graphs, and Views -- Rectangular Drawings of Planar Graphs -- Extended Rectangular Drawings of Plane Graphs with Designated Corners -- RINGS: A Technique for Visualizing Large Hierarchies -- Applying Crossing Reduction Strategies to Layered Compound Graphs -- Crossing Reduction by Windows Optimization -- Geometric Graphs with No Self-intersecting Path of Length Three -- Two New Heuristics for Two-Sided Bipartite Graph Drawing -- Straight-Line Drawings of Binary Trees with Linear Area and Arbitrary Aspect Ratio -- Some Applications of Orderly Spanning Trees in Graph Drawing -- Improving Walker's Algorithm to Run in Linear Time -- Semi-dynamic Orthogonal Drawings of Planar Graphs -- Software Demonstrations -- Graph Layout for Workflow Applications with ILOG JViews -- InterViewer: Dynamic Visualization of Protein-Protein Interactions -- Some Modifications of Sugiyama Approach -- A Framework for Complexity Management in Graph Visualization -- A Partitioned Approach to Protein Interaction Mapping -- Camera Position Reconstruction and Tight Direction Networks -- Demonstration of a Preprocessor for the Spring Embedder -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Invited Talks -- Techniques for Interactive Graph Drawing -- Drawing Venn Diagrams. 
650 0 |a Computer software. 
650 0 |a Computer science-Mathematics. 
650 0 |a Algorithms. 
650 0 |a Computer graphics. 
650 1 4 |a Mathematical Software.  |0 http://scigraph.springernature.com/things/product-market-codes/M14042 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 http://scigraph.springernature.com/things/product-market-codes/I17028 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Computer Graphics.  |0 http://scigraph.springernature.com/things/product-market-codes/I22013 
700 1 |a Kobourov, Stephen G.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Goodrich, Michael T.  |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 9783662170953 
776 0 8 |i Printed edition:  |z 9783540001584 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2528 
856 4 0 |u https://doi.org/10.1007/3-540-36151-0  |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)