Graph drawing : 7th international symposium, GD'99, Štiřín Castle, Czech Republic, September 15-19, 1999 : proceedings
The range of issues considered in graph drawing includes algorithms, graph theory, geometry, topology, order theory, graphic languages, perception, app- cations, and practical systems. Much research is motivated by applications to systems for viewing and interacting with graphs. The interaction betw...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
1731 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graph drawing, 7th international symposium, GD'99, Štiřín Castle, Czech Republic, September 15-19, 1999, proceedings, Jan Kratochvíl (ed.), New York, Springer, 1999, p. cm., Lecture notes in computer science, 3-540-66904-3 • Graph Drawing, Texte imprimé, 9783662187111 |
| LEADER | 06072nam a22004217a 4500 | ||
|---|---|---|---|
| 001 | 970876 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155197908 | ||
| 020 | |a 9783540466482 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 511.5 | ||
| 082 | |a 004 | ||
| 111 | 2 | |a International Symposium on Graph Drawing |n (07 |d :1999 |c :Štiřín Castle). | |
| 245 | 1 | 0 | |a Graph drawing : |b 7th international symposium, GD'99, Štiřín Castle, Czech Republic, September 15-19, 1999 : proceedings |c [edited by] Jan Kratochvíyl. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1731 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a Invited Talk -- The Anatomy of a Geometric Algorithm -- Orthogonality I -- Turn-Regularity and Planar Orthogonal Drawings -- Combining Graph Labeling and Compaction -- Almost Bend-Optimal Planar Orthogonal Drawings of Biconnected Degree-3 Planar Graphs in Quadratic Time -- Fully Dynamic 3-Dimensional Orthogonal Graph Drawing -- Levels I -- An E log E Line Crossing Algorithm for Levelled Graphs -- Level Planar Embedding in Linear Time -- Higres Visualization System for Clustered Graphs and Graph Algorithms -- Clusters I -- Partitioning Approach to Visualization of Large Graphs -- Graph Clustering Using Distance-k Cliques -- Drawing I -- A Framework for Circular Drawings of Networks -- Drawing Planar Graphs with Circular Arcs -- Drawing Graphs in the Hyperbolic Plane -- Invited Talk -- Graph Planarity and Related Topics -- Planarity -- Grid Drawings of Four-Connected Plane Graphs -- Graph Embedding with Topological Cycle-Constraints -- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs -- The Constrained Crossing Minimization Problem -- Clusters II -- Planarity-Preserving Clustering and Embedding for Large Planar Graphs -- An Algorithm for Drawing Compound Graphs -- Levels II -- The Vertex-Exchange Graph: A New Concept for Multi-level Crossing Minimisation -- Using Sifting for k-Layer Straightline Crossing Minimization -- On 3-Layer Crossings and Pseudo Arrangements -- Applications -- Visualizing Algorithms for the Design and Analysis of Survivable Networks -- LayoutShow: A Signed Applet/Application for Graph Drawing and Experimentation -- Centrality in Policy Network Drawings -- Straight-Line Drawings of Protein Interactions -- Invited Talk -- Art of Drawing -- Symmetry -- An Heuristic for Graph Symmetry Detection -- Isomorphic Subgraphs -- Orthogonality II -- Orthogonal and Quasi-upwardDrawings with Vertices of Prescribed Size -- Multi-dimensional Orthogonal Graph Drawing with Small Boxes -- Representations -- Geometric Realization of Simplicial Complexes -- Visibility Representations of Complete Graphs -- Triangle-Free Planar Graphs as Segments Intersection Graphs -- Drawing II -- A Force-Directed Algorithm that Preserves Edge Crossing Properties -- Proximity and Trees -- Rectangle of Influence Drawings of Graphs without Filled 3-Cycles -- Voronoi Drawings of Trees -- Infinite Trees and the Future -- Latour A Tree Visualisation System -- Graph Drawing Contest -- Graph-Drawing Contest Report -- Hunting Down Graph B -- Posters -- Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations -- Electronic Biochemical Pathways. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a The range of issues considered in graph drawing includes algorithms, graph theory, geometry, topology, order theory, graphic languages, perception, app- cations, and practical systems. Much research is motivated by applications to systems for viewing and interacting with graphs. The interaction between th- retical advances and implemented solutions is an important part of the graph drawing eld. The annually organized graph drawing symposium is a forum for researchers, practitioners, developers, and users working on all aspects of graph visualization and representations. The preceding symposia were held in M- treal (GD 98), Rome (GD 97), Berkeley (GD 96), Passau (GD 95), Princeton (GD 94), and Paris (GD 93). The Seventh International Symposium on Graph Drawing GD 99 was or- nized at Sti r n Castle, in the vicinity of Prague, Czech Republic. This baroque castle recently restored as a hotel and conference center provided a secluded place for the participants, who made good use of the working atmosphere of the conference. In total the symposium had 83 registered participants from 16 countries. | ||
| 650 | |a Informatique | ||
| 650 | |a Théorie des graphes | ||
| 650 | |a Algorithmes | ||
| 650 | |a Infographie | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Kratochvil, Jan. |4 pbd | |
| 776 | 0 | |0 049124595 |t Graph drawing |o 7th international symposium, GD'99, Štiřín Castle, Czech Republic, September 15-19, 1999 |o proceedings |f Jan Kratochvíl (ed.) |c New York |n Springer |d 1999 |p p. cm. |s Lecture notes in computer science |z 3-540-66904-3 | |
| 776 | 0 | |t Graph Drawing |b Texte imprimé |z 9783662187111 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-46648-7 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-R0WVRQ2T-H |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750658630 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-46648-7 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754008363 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-46648-7 |z Accès INSA CVL | |
| 997 | |0 970876 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||