Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Graph Drawing [[electronic resource] ] : 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers / / edited by Guiseppe Liotta
| Graph Drawing [[electronic resource] ] : 11th International Symposium, GD 2003, Perugia, Italy, September 21-24, 2003, Revised Papers / / edited by Guiseppe Liotta |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 542 p.) |
| Disciplina | 006.6 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Computer science—Mathematics Algorithms Computer graphics Discrete Mathematics Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Computer Graphics |
| ISBN |
1-280-30672-6
9786610306725 3-540-24595-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Planarity and Planar Drawings -- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way -- An Experimental Study of Crossing Minimization Heuristics -- Stop Minding Your P’s and Q’s: Implementing a Fast and Simple DFS-Based Planarity Testing and Embedding Algorithm -- Bounds and Methods for k-Planar Crossing Numbers -- Geometric Graph Theory -- How Many Ways Can One Draw a Graph? -- Two Results on Intersection Graphs of Polygons -- Stretching of Jordan Arc Contact Systems -- Noncrossing Hamiltonian Paths in Geometric Graphs -- Applications and Systems – Part I -- GraphAEL: Graph Animations with Evolving Layouts -- Visualizing Related Metabolic Pathways in Two and a Half Dimensions -- GoVisual for CASE Tools Borland Together ControlCenter and Gentleware Poseidon – System Demonstration -- Straight-Line, Circular, and Circular-Arc Drawings -- Area-Efficient Drawings of Outerplanar Graphs -- A Framework for User-Grouped Circular Drawings -- Fixed-Location Circular-Arc Drawing of Planar Graphs -- A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio -- Symmetries -- An Integer Programming Approach to Fuzzy Symmetry Detection -- Barycentric Drawings of Periodic Graphs -- 3D-Drawings -- Three-Dimensional Grid Drawings with Sub-quadratic Volume -- Laying Out Iterated Line Digraphs Using Queues -- Track Drawings of Graphs with Constant Queue Number -- 3D Visibility Representations of Complete Graphs -- Drawing Series-Parallel Graphs on Restricted Integer 3D Grids -- Nearly Optimal Three Dimensional Layout of Hypercube Networks -- Embeddings and Triangulations -- Graph Embedding with Minimum Depth and Maximum External Face -- More Efficient Generation of Plane Triangulations -- Planar Embeddings of Graphs with Specified Edge Lengths -- Applications and Systems – Part II -- BGPlay: A System for Visualizing the Interdomain Routing Evolution -- GraphEx: An Improved Graph Translation Service -- A Constrained, Force-Directed Layout Algorithm for Biological Pathways -- Intersection-Free Morphing of Planar Graphs -- Fixed Parameter Tractability -- Fixed Parameter Algorithms for one-sided crossing minimization Revisited -- Experiments with the Fixed-Parameter Approach for Two-Layer Planarization -- Clusters, Cuts, and Orthogonal Drawings -- Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles -- Convex Drawing for c-Planar Biconnected Clustered Graphs -- Layout of Directed Hypergraphs with Orthogonal Hyperedges -- No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs -- k-Level Drawings -- Radial Level Planarity Testing and Embedding in Linear Time -- An Improved Approximation to the One-Sided Bilayer Drawing -- Straight-Line Drawings of 2-Outerplanar Graphs on Two Curves -- Force Directed and Energy-Based Techniques -- An Energy Model for Visual Graph Clustering -- Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes -- Axis-by-Axis Stress Minimization -- Drawing Graphs with Nonuniform Nodes Using Potential Fields -- Surfaces and Diagrams -- Drawing Area-Proportional Venn and Euler Diagrams -- Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface -- Posters -- Degree Navigator TM : The Journey of a Visualization Software -- HexGraph: Applying Graph Drawing Algorithms to the Game of Hex -- GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions -- Web-Linkage Viewer: Drawing Links in the Web Based on a Site-Oriented Framework -- The Puzzle Layout Problem -- Visual Data Mining with ILOG Discovery -- Graph Drawing Contest -- Graph Drawing Contest Report -- Invited Talks -- Engineering and Visualizing Algorithms -- Report on the Invited Lecture by Pat Hanrahan, Titled “On Being in the Right Space” -- Open Problems -- Selected Open Problems in Graph Drawing. |
| Record Nr. | UNISA-996465905003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Drawing [[electronic resource] ] : 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings / / edited by Joe Marks
| Graph Drawing [[electronic resource] ] : 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings / / edited by Joe Marks |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 422 p.) |
| Disciplina | 511.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Discrete mathematics Computers Computer graphics Computer science—Mathematics Combinatorics Algorithm Analysis and Problem Complexity Discrete Mathematics Theory of Computation Computer Graphics Discrete Mathematics in Computer Science |
| ISBN | 3-540-44541-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- The Visual Representation of Information Structures -- Empirical Studies and Standards -- User Preference of Graph Layout Aesthetics: A UML Study -- A User Study in Similarity Measures for Graph Drawing -- Interactive Partitioning System Demonstration, Short -- An Experimental Comparison of Orthogonal Compaction Algorithms -- GraphXML — An XML-Based Graph Description Format -- Theory I -- On Polar Visibility Representations of Graphs -- A Linear Time Implementation of SPQR-Trees -- Labeling Points with Rectangles of Various Shapes -- How to Draw the Minimum Cuts of a Planar Graph -- Applications and Systems -- 2D-Structure Drawings of Similar Molecules -- Fast Layout Methods for Timetable Graphs -- An Algorithmic Framework for Visualizing Statecharts -- Visualization of the Autonomous Systems Interconnections with Hermes -- Drawing Hypergraphs in the Subset Standard (Short Demo Paper) -- Invited Talk -- Knowledge Discovery from Graphs -- Force-Directed Layout -- A Multilevel Algorithm for Force-Directed Graph Drawing -- A Fast Multi-scale Method for Drawing Large Graphs -- FADE: Graph Drawing, Clustering, and Visual Abstraction -- A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs -- GRIP: Graph dRawing with Intelligent Placement -- k-Level Graph Layout -- A Fast Layout Algorithm for k-Level Graphs -- Graph Layout for Displaying Data Structures -- k-Layer Straightline Crossing Minimization by Speeding Up Sifting -- Orthogonal Drawing I -- Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings -- Orthogonal Drawings of Cycles in 3D Space -- Three-Dimensional Orthogonal Graph Drawing with Optimal Volume -- Orthogonal Drawing II -- A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs -- Refinement of Three-Dimensional Orthogonal Graph Drawings -- Theory II -- ?-Searchlight Obedient Graph Drawings -- Unavoidable Configurations in Complete Topological Graphs -- Minimum Weight Drawings of Maximal Triangulations -- A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band -- Symmetry and Incremental Layout -- An Algorithm for Finding Three Dimensional Symmetry in Trees -- On Maximum Symmetric Subgraphs -- Clan-Based Incremental Drawing -- The Marey Graph Animation Tool Demo -- Workshop and Contest -- Graph Data Format Workshop Report -- Graph-Drawing Contest Report. |
| Record Nr. | UNINA-9910143605703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph Drawing [[electronic resource] ] : 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings / / edited by Joe Marks
| Graph Drawing [[electronic resource] ] : 8th International Symposium, GD 2000, Colonial Williamsburg, VA, USA, September 20-23, 2000, Proceedings / / edited by Joe Marks |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XII, 422 p.) |
| Disciplina | 511.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Discrete mathematics Computers Computer graphics Computer science—Mathematics Combinatorics Algorithm Analysis and Problem Complexity Discrete Mathematics Theory of Computation Computer Graphics Discrete Mathematics in Computer Science |
| ISBN | 3-540-44541-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- The Visual Representation of Information Structures -- Empirical Studies and Standards -- User Preference of Graph Layout Aesthetics: A UML Study -- A User Study in Similarity Measures for Graph Drawing -- Interactive Partitioning System Demonstration, Short -- An Experimental Comparison of Orthogonal Compaction Algorithms -- GraphXML — An XML-Based Graph Description Format -- Theory I -- On Polar Visibility Representations of Graphs -- A Linear Time Implementation of SPQR-Trees -- Labeling Points with Rectangles of Various Shapes -- How to Draw the Minimum Cuts of a Planar Graph -- Applications and Systems -- 2D-Structure Drawings of Similar Molecules -- Fast Layout Methods for Timetable Graphs -- An Algorithmic Framework for Visualizing Statecharts -- Visualization of the Autonomous Systems Interconnections with Hermes -- Drawing Hypergraphs in the Subset Standard (Short Demo Paper) -- Invited Talk -- Knowledge Discovery from Graphs -- Force-Directed Layout -- A Multilevel Algorithm for Force-Directed Graph Drawing -- A Fast Multi-scale Method for Drawing Large Graphs -- FADE: Graph Drawing, Clustering, and Visual Abstraction -- A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs -- GRIP: Graph dRawing with Intelligent Placement -- k-Level Graph Layout -- A Fast Layout Algorithm for k-Level Graphs -- Graph Layout for Displaying Data Structures -- k-Layer Straightline Crossing Minimization by Speeding Up Sifting -- Orthogonal Drawing I -- Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings -- Orthogonal Drawings of Cycles in 3D Space -- Three-Dimensional Orthogonal Graph Drawing with Optimal Volume -- Orthogonal Drawing II -- A Linear-Time Algorithm for Bend-Optimal Orthogonal Drawings of Biconnected Cubic Plane Graphs -- Refinement of Three-Dimensional Orthogonal Graph Drawings -- Theory II -- ?-Searchlight Obedient Graph Drawings -- Unavoidable Configurations in Complete Topological Graphs -- Minimum Weight Drawings of Maximal Triangulations -- A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band -- Symmetry and Incremental Layout -- An Algorithm for Finding Three Dimensional Symmetry in Trees -- On Maximum Symmetric Subgraphs -- Clan-Based Incremental Drawing -- The Marey Graph Animation Tool Demo -- Workshop and Contest -- Graph Data Format Workshop Report -- Graph-Drawing Contest Report. |
| Record Nr. | UNISA-996465883403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Drawing [[electronic resource] ] : Symposium on Graph Drawing GD'96, Berkeley, California, USA, September 18 - 20, 1996, Proceedings / / edited by Stephen North
| Graph Drawing [[electronic resource] ] : Symposium on Graph Drawing GD'96, Berkeley, California, USA, September 18 - 20, 1996, Proceedings / / edited by Stephen North |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XIII, 415 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science—Mathematics
Computer-aided engineering Discrete mathematics Algorithms Computer graphics Combinatorics Discrete Mathematics in Computer Science Computer-Aided Engineering (CAD, CAE) and Design Discrete Mathematics Algorithm Analysis and Problem Complexity Computer Graphics |
| ISBN | 3-540-68048-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Bipartite embeddings of trees in the plane -- Series-parallel planar ordered sets have pagenumber two -- On rectangle visibility graphs -- A graph drawing and translation service on the WWW -- Drawing 2-, 3- and 4-colorable graphs in O(n2) volume -- Optimizing area and aspect ratio in straight-line orthogonal tree drawings -- Drawing directed acyclic graphs: An experimental study -- Circular layout in the Graph Layout toolkit -- Multilevel visualization of clustered graphs -- Straight-line drawing algorithms for hierarchical graphs and clustered graphs -- Graph-Drawing contest report -- Two algorithms for three dimensional orthogonal graph drawing -- 2-Visibility drawings of planar graphs -- Upper bounds on the number of hidden nodes in Sugiyama's algorithm -- Integration of declarative approaches (System Demonstration) -- GIOTTO3D: A system for visualizing hierarchical structures in 3D -- A new minimum cost flow algorithm with applications to graph drawing -- Constrained graph layout -- The graphlet system (system demonstration) -- On the Edge Label Placement problem -- Intersection graphs of noncrossing arc-connected sets in the plane -- Wiring edge-disjoint layouts -- Proximity drawings of outerplanar graphs (extended abstract) -- Automatic visualization of two-dimensional cellular complexes -- An alternative method to crossing minimization on hierarchical graphs -- A linear-time algorithm for four-partitioning four-connected planar graphs -- Graphs drawn with few crossings per edge -- A pairing technique for area-efficient orthogonal drawings (extended abstract) -- Experimental and theoretical results in interactive orthogonal graph drawing -- An interactive system for drawing graphs -- Automatic graph clustering (system demonstration) -- Qualitative visualization of processes: Attributed graph layout and focusing techniques. |
| Record Nr. | UNISA-996466237103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Drawing [[electronic resource] ] : 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997. Proceedings / / edited by Giuseppe DiBattista
| Graph Drawing [[electronic resource] ] : 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997. Proceedings / / edited by Giuseppe DiBattista |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XII, 456 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Discrete mathematics Computer-aided engineering Computer science—Mathematics Combinatorics Algorithms Theory of Computation Discrete Mathematics Computer-Aided Engineering (CAD, CAE) and Design Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-69674-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Drawable and forbidden minimum weight triangulations -- A polyhedral approach to the multi-layer crossing minimization problem -- On embedding an outer-planar graph in a point set -- Bipartite crossing numbers of meshes and hypercubes -- Three-dimensional grid drawings of graphs -- Incremental orthogonal graph drawing in three dimensions -- On three-dimensional layout of interconnection networks -- Orthogonal 3-D graph drawing -- Finding the best viewpoints for three-dimensional graph drawings -- A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs -- Interactive orthogonal graph drawing: Algorithms and bounds -- Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard -- Algorithms and area bounds for nonplanar orthogonal drawings -- Drawing clustered graphs on an orthogonal grid -- Graph clustering I: Cycles of cliques -- An algorithm for labeling edges of hierarchical drawings -- Elastic labels: The two-axis case -- Pitfalls of using PQ-trees in automatic graph drawing -- Graph drawing with no k pairwise crossing edges -- Area requirements for drawing hierarchically planar graphs -- A short proof of a Gauss problem -- A bayesian paradigm for dynamic graph layout -- Which aesthetic has the greatest effect on human understanding? -- Implementing a general-purpose edge router -- The wobbly logic engine: Proving hardness of non-rigid geometric graph representation problems -- 3DCube: A tool for three dimensional graph drawing -- Graph clustering using multiway ratio cut (Software demonstration) -- ArchE: A graph drawing system for archaeology -- InteractiveGiotto: An algorithm for interactive orthogonal graph drawing -- GRID: An interactive tool for computing orthogonal drawings with the minimum number of bends -- Lexical navigation: Using incremental graph drawing for query refinement -- Design gallery browsers based on 2D and 3D graph drawing (Demo) -- Online animated graph drawing for web navigation -- Grappa: A graph package in java -- GraVis — System demonstration -- Touching graphs of unit balls -- Discrete realizations of contact and intersection graphs (extended abstract) -- Minimum-area h-v drawings of complete binary trees -- Packing trees into planar graphs -- The three-phase method: A unified approach to orthogonal graph drawing -- NicheWorks — Interactive visualization of very large graphs -- Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams -- Graph drawing and manipulation with LINK -- Graph-drawing contest report. |
| Record Nr. | UNINA-9910144917903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph Drawing [[electronic resource] ] : 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997. Proceedings / / edited by Giuseppe DiBattista
| Graph Drawing [[electronic resource] ] : 5th International Symposium, GD '97, Rome, Italy, September 18-20, 1997. Proceedings / / edited by Giuseppe DiBattista |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XII, 456 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Discrete mathematics Computer-aided engineering Computer science—Mathematics Combinatorics Algorithms Theory of Computation Discrete Mathematics Computer-Aided Engineering (CAD, CAE) and Design Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-69674-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Drawable and forbidden minimum weight triangulations -- A polyhedral approach to the multi-layer crossing minimization problem -- On embedding an outer-planar graph in a point set -- Bipartite crossing numbers of meshes and hypercubes -- Three-dimensional grid drawings of graphs -- Incremental orthogonal graph drawing in three dimensions -- On three-dimensional layout of interconnection networks -- Orthogonal 3-D graph drawing -- Finding the best viewpoints for three-dimensional graph drawings -- A linear algorithm for optimal orthogonal drawings of triconnected cubic plane graphs -- Interactive orthogonal graph drawing: Algorithms and bounds -- Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard -- Algorithms and area bounds for nonplanar orthogonal drawings -- Drawing clustered graphs on an orthogonal grid -- Graph clustering I: Cycles of cliques -- An algorithm for labeling edges of hierarchical drawings -- Elastic labels: The two-axis case -- Pitfalls of using PQ-trees in automatic graph drawing -- Graph drawing with no k pairwise crossing edges -- Area requirements for drawing hierarchically planar graphs -- A short proof of a Gauss problem -- A bayesian paradigm for dynamic graph layout -- Which aesthetic has the greatest effect on human understanding? -- Implementing a general-purpose edge router -- The wobbly logic engine: Proving hardness of non-rigid geometric graph representation problems -- 3DCube: A tool for three dimensional graph drawing -- Graph clustering using multiway ratio cut (Software demonstration) -- ArchE: A graph drawing system for archaeology -- InteractiveGiotto: An algorithm for interactive orthogonal graph drawing -- GRID: An interactive tool for computing orthogonal drawings with the minimum number of bends -- Lexical navigation: Using incremental graph drawing for query refinement -- Design gallery browsers based on 2D and 3D graph drawing (Demo) -- Online animated graph drawing for web navigation -- Grappa: A graph package in java -- GraVis — System demonstration -- Touching graphs of unit balls -- Discrete realizations of contact and intersection graphs (extended abstract) -- Minimum-area h-v drawings of complete binary trees -- Packing trees into planar graphs -- The three-phase method: A unified approach to orthogonal graph drawing -- NicheWorks — Interactive visualization of very large graphs -- Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of object-oriented software diagrams -- Graph drawing and manipulation with LINK -- Graph-drawing contest report. |
| Record Nr. | UNISA-996466078703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Drawing [[electronic resource] ] : Symposium on Graph Drawing GD'96, Berkeley, California, USA, September 18 - 20, 1996, Proceedings / / edited by Stephen North
| Graph Drawing [[electronic resource] ] : Symposium on Graph Drawing GD'96, Berkeley, California, USA, September 18 - 20, 1996, Proceedings / / edited by Stephen North |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XIII, 415 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science—Mathematics
Computer-aided engineering Discrete mathematics Algorithms Computer graphics Combinatorics Discrete Mathematics in Computer Science Computer-Aided Engineering (CAD, CAE) and Design Discrete Mathematics Algorithm Analysis and Problem Complexity Computer Graphics |
| ISBN | 3-540-68048-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Bipartite embeddings of trees in the plane -- Series-parallel planar ordered sets have pagenumber two -- On rectangle visibility graphs -- A graph drawing and translation service on the WWW -- Drawing 2-, 3- and 4-colorable graphs in O(n2) volume -- Optimizing area and aspect ratio in straight-line orthogonal tree drawings -- Drawing directed acyclic graphs: An experimental study -- Circular layout in the Graph Layout toolkit -- Multilevel visualization of clustered graphs -- Straight-line drawing algorithms for hierarchical graphs and clustered graphs -- Graph-Drawing contest report -- Two algorithms for three dimensional orthogonal graph drawing -- 2-Visibility drawings of planar graphs -- Upper bounds on the number of hidden nodes in Sugiyama's algorithm -- Integration of declarative approaches (System Demonstration) -- GIOTTO3D: A system for visualizing hierarchical structures in 3D -- A new minimum cost flow algorithm with applications to graph drawing -- Constrained graph layout -- The graphlet system (system demonstration) -- On the Edge Label Placement problem -- Intersection graphs of noncrossing arc-connected sets in the plane -- Wiring edge-disjoint layouts -- Proximity drawings of outerplanar graphs (extended abstract) -- Automatic visualization of two-dimensional cellular complexes -- An alternative method to crossing minimization on hierarchical graphs -- A linear-time algorithm for four-partitioning four-connected planar graphs -- Graphs drawn with few crossings per edge -- A pairing technique for area-efficient orthogonal drawings (extended abstract) -- Experimental and theoretical results in interactive orthogonal graph drawing -- An interactive system for drawing graphs -- Automatic graph clustering (system demonstration) -- Qualitative visualization of processes: Attributed graph layout and focusing techniques. |
| Record Nr. | UNINA-9910768176803321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph Drawing [[electronic resource] ] : DIMACS International Workshop, GD '94, Princeton, New Jersey, USA, October 10 - 12, 1994. Proceedings / / edited by Roberto Tamassia, Ioannis G. Tollis
| Graph Drawing [[electronic resource] ] : DIMACS International Workshop, GD '94, Princeton, New Jersey, USA, October 10 - 12, 1994. Proceedings / / edited by Roberto Tamassia, Ioannis G. Tollis |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (CDLXXXVIII, 478 p.) |
| Disciplina | 006.6 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Application software
Discrete mathematics Algorithms Combinatorics Software engineering Computer graphics Computer Applications Discrete Mathematics Algorithm Analysis and Problem Complexity Software Engineering Computer Graphics |
| ISBN | 3-540-49155-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Three-dimensional graph drawing -- 3-D visualization of program information (extended abstract and system demonstration) -- 3D layout of reachability graphs of communicating processes -- A flow approach to upward drawings of toroidal maps -- Improved algorithms and bounds for orthogonal drawings -- On bend-minimum orthogonal upward drawing of directed planar graphs -- Grid layouts of block diagrams — bounding the number of bends in each connection (extended abstract) -- On drawing a graph convexly in the plane (extended abstract) -- On drawing angle graphs -- Regular edge labelings and drawings of planar graphs -- Minimum-width grid drawings of plane graphs extend abstract -- Regular orientations, arboricity, and augmentation -- The polyhedral approach to the maximum planar subgraph problem: New chances for related problems -- Crossing numbers of graphs, lower bound techniques and algorithms: A survey -- Graph-drawing contest report -- Visibility graphs and oriented matroids (extended abstract) -- Rectangle-visibility representations of bipartite graphs -- On the number of directions in visibility representations of graphs (extended abstract) -- Directed VR-representable graphs have unbounded dimension -- GraphEd: A graphical platform for the implementation of graph algorithms (extended abstract and demo) -- Graph layout through the VCG tool -- Drawing telecommunication networks -- Reduction of visual complexity in dynamic graphs -- TOSCANA — A graphical tool for analyzing and exploring data -- Characterization and recognition of point-halfspace and related orders -- Redrawing a graph within a geometric tolerance -- On the difficulty of embedding planar graphs with inaccuracies -- A system for drawing graphs with geometric symmetry -- Demonstration of the interactive graph visualization system da Vinci -- CG: A graph drawing system using graph-grammar parsing -- A demonstration of interactive graph based visual language applications -- A simple algorithm for drawing large graphs on small screens -- Molecular graph eigenvectors for molecular coordinates -- On the computational complexity of upward and rectilinear planarity testing -- Upward planarity testing of outerplanar dags (extended abstract) -- Optimal-area upward drawings of AVL trees -- Upward drawing on the plane grid using less ink -- Proximity drawability: A survey extended abstract -- Proximity constraints and representable trees (extended abstract) -- Recognizing rectangle of influence drawable graphs (extended abstract) -- A simple and unified method for drawing graphs: Magnetic-spring algorithm -- Integration of declarative and algorithmic approaches for layout creation -- A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration) -- Drawing graphs by example efficiently: Trees and planar acyclic digraphs (extended abstract) -- Designing graph drawings by layout graph grammars -- Encoding presentation emphasis algorithms for graphs -- A practical approach to static node positioning -- Map generalization as a graph drawing problem -- A geometrical heuristic for drawing concept lattices -- Poster gallery report. |
| Record Nr. | UNISA-996466094003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Grammars and Their Application to Computer Science [[electronic resource] ] : 5th International Workshop, Williamsburg, VA, USA, November (13-18), 1995. Selected Papers. / / edited by Janice Cuny, Hartmut Ehrig, Gregor Engels, Grzegorz Rozenberg
| Graph Grammars and Their Application to Computer Science [[electronic resource] ] : 5th International Workshop, Williamsburg, VA, USA, November (13-18), 1995. Selected Papers. / / edited by Janice Cuny, Hartmut Ehrig, Gregor Engels, Grzegorz Rozenberg |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (XI, 573 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Computer science—Mathematics Mathematical logic Artificial intelligence Discrete Mathematics Mathematics of Computing Mathematical Logic and Formal Languages Mathematical Logic and Foundations Symbolic and Algebraic Manipulation Artificial Intelligence |
| ISBN | 3-540-68388-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A partial algebras approach to graph transformation -- The contractum in algebraic graph rewriting -- A category-theoretical approach to vertex replacement: The generation of infinite graphs -- Issues in the practical use of graph rewriting -- The category of typed graph grammars and its adjunctions with categories of derivations -- Graph unification and matching -- On the interleaving semantics of transformation units — A step into GRACE -- A graph rewriting framework for Statecharts semantics -- Programmed graph transformations and graph transformation units in GRACE -- Pragmatic and semantic aspects of a module concept for graph transformation systems -- Software integration problems and coupling of graph grammar specifications -- Using attributed flow graph parsing to recognize clichés in programs -- Reconfiguration Graph Grammar for massively parallel, fault tolerant computers -- The use of tree transducers to compute translations between graph algebras -- The bounded degree problem for non-obstructing eNCE graph grammars -- Process specification and verification -- An event structure semantics for graph grammars with parallel productions -- Synchronized composition of graph grammar productions -- The decomposition of ESM computations -- Formal relationship between graph grammars and Petri nets -- Hierarchically distributed graph transformation -- On edge addition rewrite systems and their relevance to program analysis -- Graph automata for linear graph languages -- The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed -- Concatenation of graphs -- HRNCE grammars — A hypergraph generating system with an eNCE way of rewriting -- Node replacement in hypergraphs: Simulation of hyperedge replacement, and decidability of confluence -- Chain-code pictures and collages generated by hyperedge replacement -- Transformations of graph grammars -- Drawing graphs with attribute graph grammars -- Graph pattern matching in PROGRES -- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths -- The definition in monadic second-order logic of modular decompositions of ordered graphs -- Group based graph transformations and hierarchical representations of graphs -- Integrating lineage and interaction for the visualization of cellular structures -- Cellworks with cell rewriting and cell packing for plant morphogenesis -- Subapical bracketed L-systems. |
| Record Nr. | UNISA-996465595203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph Transformation [[electronic resource] ] : First International Conference, ICGT 2002, Barcelona, Spain, October 7-12, 2002, Proceedings / / edited by Andrea Corradini, Hartmut Ehrig, Hans-Jörg Kreowski, Grzegorz Rozenberg
| Graph Transformation [[electronic resource] ] : First International Conference, ICGT 2002, Barcelona, Spain, October 7-12, 2002, Proceedings / / edited by Andrea Corradini, Hartmut Ehrig, Hans-Jörg Kreowski, Grzegorz Rozenberg |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (X, 466 p.) |
| Disciplina | 511/.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Optical data processing
Discrete mathematics Database management Computer science—Mathematics Data structures (Computer science) Software engineering Image Processing and Computer Vision Discrete Mathematics Database Management Discrete Mathematics in Computer Science Data Structures Software Engineering |
| ISBN | 3-540-45832-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Ubiquitous, Decentralized, and Evolving Software: Challenges for Software Engineering -- Can Behavioral Requirements Be Executed? (And Why Would We Want to Do So?) -- Biographs as a Model for Mobile Interaction -- Contributed Papers -- Approximating the Behaviour of Graph Transformation Systems -- Transforming Specification Architectures by GenGED -- Decomposing Graphs with Symmetries -- Graph Transformations for the Vehicle Routing and Job Shop Scheduling Problems -- Call-by-Value ?-Graph Rewriting Without Rewriting -- Transformation: The Missing Link of MDA -- Termination Detection of Distributed Algorithms by Graph Relabelling Systems -- Graph Transformation with Time: Causality and Logical Clocks -- Relabelling in Graph Transformation -- Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes -- Confluence of Typed Attributed Graph Transformation Systems -- Abstraction and Control for Shapely Nested Graph Transformation -- Hyperedge Substitution in Basic Atom-Replacement Languages -- Distributed Graph Transformation Units -- Describing Policies with Graph Constraints and Rules -- Computer Aided Multi-paradigm Modelling to Process Petri-Nets and Statecharts -- Using Graph Transformation as the Semantical Model for Software Process Execution in the APSEE Environment -- Graph-Based Reengineering of Telecommunication Systems -- Formalising Behaviour Preserving Program Transformations -- Unparsing of Diagrams with DiaGen -- Linear Ordered Graph Grammars and Their Algebraic Foundations -- Rule Invariants in Graph Transformation Systems for Analyzing Safety-Critical Systems -- Incremental Transformation of Lattices: A Key to Effective Knowledge Discovery -- GraCAD – Graph-Based Tool for Conceptual Design -- A Formal Semantics of UML State charts by Model Transition Systems -- Hierarchical Vertex Ordering -- Tutorials and Workshops -- Tutorial Introduction to Graph Transformation: A Software Engineering Perspective -- Tutorial on DNA Computing and Graph Transformation - Computational Nature of Gene Assembly in Ciliates -- TERMGRAPH 2002 Workshop Survey -- Workshop on Graph-Based Tools -- Workshop on Graph Transformation and Visual Modeling Techniques -- Workshop on Software Evolution through Transformations: Towards Uniform Support throughout the Software Life-Cycle -- Workshop on Logic, Graph Transformations and Discrete Structures. |
| Record Nr. | UNISA-996465395003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
