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.
Applications of Graph Transformations with Industrial Relevance [[electronic resource] ] : Second International Workshop, AGTIVE 2003, Charlottesville, VA, USA, September 27 - October 1, 2003, Revised Selected and Invited Papers / / edited by John L. Pfaltz, Manfred Nagl, Boris Böhlen
| Applications of Graph Transformations with Industrial Relevance [[electronic resource] ] : Second International Workshop, AGTIVE 2003, Charlottesville, VA, USA, September 27 - October 1, 2003, Revised Selected and Invited Papers / / edited by John L. Pfaltz, Manfred Nagl, Boris Böhlen |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XVI, 504 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Software engineering Computer logic Mathematical logic Data structures (Computer science) Algorithms Discrete Mathematics Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages Data Structures Algorithm Analysis and Problem Complexity |
| ISBN |
1-280-30773-0
9786610307739 3-540-25959-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Web Applications -- Graph Transformation for Merging User Navigation Histories -- Towards Validation of Session Management in Web Applications based on Graph Transformation -- Data Structures and Data Bases -- Specifying Pointer Structures by Graph Reduction -- Specific Graph Models and Their Mappings to a Common Model -- Engineering Applications -- Transforming Graph Based Scenarios into Graph Transformation Based JUnit Tests -- On Graphs in Conceptual Engineering Design -- Parameterized Specification of Conceptual Design Tools in Civil Engineering -- Agent-Oriented and Functional Programs, Distribution -- Design of an Agent-Oriented Modeling Language Based on Graph Transformation -- Specification and Analysis of Fault Behaviours Using Graph Grammars -- Object and Aspect-Oriented Systems -- Integrating Graph Rewriting and Standard Software Tools -- Expressing Component-Relating Aspects with Graph Transformations -- Natural Languages: Processing and Structuring -- Modeling Discontinuous Constituents with Hypergraph Grammars -- Authoring Support Based on User-Serviceable Graph Transformation -- Re-engineering -- Re-engineering a Medical Imaging System Using Graph Transformations -- Behavioral Analysis of Telecommunication Systems by Graph Transformations -- Reuse and Integration -- Specifying Integrated Refactoring with Distributed Graph Transformations -- A Domain Specific Architecture Tool: Rapid Prototyping with Graph Grammars -- Modelling Languages -- Graph Transformations in OMG’s Model-Driven Architecture -- Computing Reading Trees for Constraint Diagrams -- UML Interaction Diagrams: Correct Translation of Sequence Diagrams into Collaboration Diagrams -- Meta-Modelling, Graph Transformation and Model Checking for the Analysis of Hybrid Systems -- Bioinformatics -- Proper Down-Coloring Simple Acyclic Digraphs -- Local Specification of Surface Subdivision Algorithms -- Transforming Toric Digraphs -- Management of Development and Processes -- Graph-Based Specification of a Management System for Evolving Development Processes -- Graph-Based Tools for Distributed Cooperation in Dynamic Development Processes -- Multimedia, Picture, and Visual Languages -- MPEG-7 Semantic Descriptions: Graph Transformations, Graph Grammars, and the Description of Multimedia -- Collage Grammars for Collision-Free Growing of Objects in 3D Scenes -- VisualDiaGen – A Tool for Visually Specifying and Generating Visual Editors -- Demos -- GenGED – A Visual Definition Tool for Visual Modeling Environments -- CHASID – A Graph-Based Authoring Support System -- Interorganizational Management of Development Processes -- Conceptual Design Tools for Civil Engineering -- E-CARES – Telecommunication Re- and Reverse Engineering Tools -- AGG: A Graph Transformation Environment for Modeling and Validation of Software -- Process Evolution Support in the AHEAD System -- Fire3: Architecture Refinement for A-posteriori Integration -- A Demo of OptimixJ -- Visual Specification of Visual Editors with VisualDiaGen -- The GROOVE Simulator: A Tool for State Space Generation -- Summaries of the Workshop -- AGTIVE’03: Summary from the Outside In -- AGTIVE’03: Summary from the Theoretical Point of View -- AGTIVE’03: Summary from the Viewpoint of Graph Transformation Specifications -- AGTIVE’03: Summary from a Tool Builder’s Viewpoint -- Best Presentation and Demonstration Awards. |
| Record Nr. | UNISA-996466226203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applications of Graph Transformations with Industrial Relevance : Second International Workshop, AGTIVE 2003, Charlottesville, VA, USA, September 27 - October 1, 2003, Revised Selected and Invited Papers / / edited by John L. Pfaltz, Manfred Nagl, Boris Böhlen
| Applications of Graph Transformations with Industrial Relevance : Second International Workshop, AGTIVE 2003, Charlottesville, VA, USA, September 27 - October 1, 2003, Revised Selected and Invited Papers / / edited by John L. Pfaltz, Manfred Nagl, Boris Böhlen |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XVI, 504 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Discrete mathematics
Software engineering Computer logic Mathematical logic Data structures (Computer science) Algorithms Discrete Mathematics Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages Data Structures Algorithm Analysis and Problem Complexity |
| ISBN |
1-280-30773-0
9786610307739 3-540-25959-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Web Applications -- Graph Transformation for Merging User Navigation Histories -- Towards Validation of Session Management in Web Applications based on Graph Transformation -- Data Structures and Data Bases -- Specifying Pointer Structures by Graph Reduction -- Specific Graph Models and Their Mappings to a Common Model -- Engineering Applications -- Transforming Graph Based Scenarios into Graph Transformation Based JUnit Tests -- On Graphs in Conceptual Engineering Design -- Parameterized Specification of Conceptual Design Tools in Civil Engineering -- Agent-Oriented and Functional Programs, Distribution -- Design of an Agent-Oriented Modeling Language Based on Graph Transformation -- Specification and Analysis of Fault Behaviours Using Graph Grammars -- Object and Aspect-Oriented Systems -- Integrating Graph Rewriting and Standard Software Tools -- Expressing Component-Relating Aspects with Graph Transformations -- Natural Languages: Processing and Structuring -- Modeling Discontinuous Constituents with Hypergraph Grammars -- Authoring Support Based on User-Serviceable Graph Transformation -- Re-engineering -- Re-engineering a Medical Imaging System Using Graph Transformations -- Behavioral Analysis of Telecommunication Systems by Graph Transformations -- Reuse and Integration -- Specifying Integrated Refactoring with Distributed Graph Transformations -- A Domain Specific Architecture Tool: Rapid Prototyping with Graph Grammars -- Modelling Languages -- Graph Transformations in OMG’s Model-Driven Architecture -- Computing Reading Trees for Constraint Diagrams -- UML Interaction Diagrams: Correct Translation of Sequence Diagrams into Collaboration Diagrams -- Meta-Modelling, Graph Transformation and Model Checking for the Analysis of Hybrid Systems -- Bioinformatics -- Proper Down-Coloring Simple Acyclic Digraphs -- Local Specification of Surface Subdivision Algorithms -- Transforming Toric Digraphs -- Management of Development and Processes -- Graph-Based Specification of a Management System for Evolving Development Processes -- Graph-Based Tools for Distributed Cooperation in Dynamic Development Processes -- Multimedia, Picture, and Visual Languages -- MPEG-7 Semantic Descriptions: Graph Transformations, Graph Grammars, and the Description of Multimedia -- Collage Grammars for Collision-Free Growing of Objects in 3D Scenes -- VisualDiaGen – A Tool for Visually Specifying and Generating Visual Editors -- Demos -- GenGED – A Visual Definition Tool for Visual Modeling Environments -- CHASID – A Graph-Based Authoring Support System -- Interorganizational Management of Development Processes -- Conceptual Design Tools for Civil Engineering -- E-CARES – Telecommunication Re- and Reverse Engineering Tools -- AGG: A Graph Transformation Environment for Modeling and Validation of Software -- Process Evolution Support in the AHEAD System -- Fire3: Architecture Refinement for A-posteriori Integration -- A Demo of OptimixJ -- Visual Specification of Visual Editors with VisualDiaGen -- The GROOVE Simulator: A Tool for State Space Generation -- Summaries of the Workshop -- AGTIVE’03: Summary from the Outside In -- AGTIVE’03: Summary from the Theoretical Point of View -- AGTIVE’03: Summary from the Viewpoint of Graph Transformation Specifications -- AGTIVE’03: Summary from a Tool Builder’s Viewpoint -- Best Presentation and Demonstration Awards. |
| Record Nr. | UNINA-9910144159603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Applications of Graph Transformations with Industrial Relevance [[electronic resource] ] : International Workshop, AGTIVE'99 Kerkrade, The Netherlands, September 1-3, 1999 Proceedings / / edited by Manfred Nagl, Andreas Schürr, Manfred Münch
| Applications of Graph Transformations with Industrial Relevance [[electronic resource] ] : International Workshop, AGTIVE'99 Kerkrade, The Netherlands, September 1-3, 1999 Proceedings / / edited by Manfred Nagl, Andreas Schürr, Manfred Münch |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XV, 496 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Optical data processing
Pattern recognition Business Management science Software engineering Computer logic Mathematical logic Image Processing and Computer Vision Pattern Recognition Business and Management, general Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-45104-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modularization Concepts -- Term Graph Rewriting and Mobile Expressions in Functional Languages -- Graph Transformation Modules and Their Composition -- Modeling Distributed Systems by Modular Graph Transformation Based on Refinement via Rule Expressions -- Distributed System Modelling -- From UML Descriptions of High-Level Software Architectures to LQN Performance Models -- On a Uniform Representation of Transformation Systems -- A Note on Modeling Agent Systems by Graph Transformation -- Compositional Construction of Simulation Models Using Graph Grammars -- Software Architectures: Evolution and Reengineering -- Graph-Based Reverse Engineering and Reengineering Tools -- Support for Design Patterns through Graph Transformation Tools -- Conditional Graph Rewriting as a Domain-Independent Formalism for Software Evolution -- Visual Graph Transformation Languages -- Visual Languages: Where Do We Stand? -- From Graph Transformation to Rule-Based Programming with Diagrams -- Using Fujaba for the Development of Production Control Systems -- Visual Language Modeling and Tool Development -- A Formal Definition of Structured Analysis with Programmable Graph Grammars -- Creating Semantic Representations of Diagrams -- Defining the Syntax and Semantics of Natural Visual Languages -- GENGED A Development Environment for Visual Languages -- Tool Development and Knowledge Modeling in Different Applications -- Graph Visualisation in ArchiCAD -- A Combined Graph Schema and Graph Grammar Approach to Consistency in Distributed Modeling -- Improving the Publication Chain through High-Level Authoring Support -- Learning and Rewriting in Fuzzy Rule Graphs -- A Proof Tool Dedicated to Clean -- Image Recognition and Constraint Solving -- Document Table Recognition by Graph Rewriting -- Image Structure from Monotonic Dual Graph Contraction -- Planning Geometric Constraint Decomposition via Optimal Graph Transformations -- Process Modeling and View Integration -- AHEAD: A Graph-Based System for Modeling and Managing Development Processes -- Formalizing UML-Based Process Models Using Graph Transformations -- Formal Integration of Software Engineering Aspects Using a Graph Rewrite System - A Typical Experience ?! - -- Towards Integrating Multiple Perspectives by Distributed Graph Transformation -- Visualization and Animation Tools -- Graph Algorithm Animation with Grrr -- An L-System-Based Plant Modeling Language -- Tool Demonstrations -- TREEBAG — a Short Presentation -- Tool Support for ViewPoint-Oriented Software Development -- UPGRADE — A Framework for Graph-Based Visual Applications -- Generating Diagram Editors with DiaGen -- PROgrammed Graph REwriting System PROGRES -- Testing and Simulating Production Control Systems Using the Fujaba Environment -- L-Studio/cpfg: A Software System for Modeling Plants -- DiTo — A Distribution Tool Based on Graph Rewriting -- A Demonstration of the Grrr Graph Rewriting Programming Language -- AGG: A Tool Environment for Algebraic Graph Transformation -- AGTIVE Workshop/Synmposium Panel Discussion on Industrial Relevance of Graph Transformation: The Reality and Our Dreams -- Best Presentation and Demonstration Awards. |
| Record Nr. | UNISA-996465613803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Applications of Graph Transformations with Industrial Relevance : International Workshop, AGTIVE'99 Kerkrade, The Netherlands, September 1-3, 1999 Proceedings / / edited by Manfred Nagl, Andreas Schürr, Manfred Münch
| Applications of Graph Transformations with Industrial Relevance : International Workshop, AGTIVE'99 Kerkrade, The Netherlands, September 1-3, 1999 Proceedings / / edited by Manfred Nagl, Andreas Schürr, Manfred Münch |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XV, 496 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Optical data processing
Pattern recognition Business Management science Software engineering Computer logic Mathematical logic Image Processing and Computer Vision Pattern Recognition Business and Management, general Software Engineering Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-540-45104-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Modularization Concepts -- Term Graph Rewriting and Mobile Expressions in Functional Languages -- Graph Transformation Modules and Their Composition -- Modeling Distributed Systems by Modular Graph Transformation Based on Refinement via Rule Expressions -- Distributed System Modelling -- From UML Descriptions of High-Level Software Architectures to LQN Performance Models -- On a Uniform Representation of Transformation Systems -- A Note on Modeling Agent Systems by Graph Transformation -- Compositional Construction of Simulation Models Using Graph Grammars -- Software Architectures: Evolution and Reengineering -- Graph-Based Reverse Engineering and Reengineering Tools -- Support for Design Patterns through Graph Transformation Tools -- Conditional Graph Rewriting as a Domain-Independent Formalism for Software Evolution -- Visual Graph Transformation Languages -- Visual Languages: Where Do We Stand? -- From Graph Transformation to Rule-Based Programming with Diagrams -- Using Fujaba for the Development of Production Control Systems -- Visual Language Modeling and Tool Development -- A Formal Definition of Structured Analysis with Programmable Graph Grammars -- Creating Semantic Representations of Diagrams -- Defining the Syntax and Semantics of Natural Visual Languages -- GENGED A Development Environment for Visual Languages -- Tool Development and Knowledge Modeling in Different Applications -- Graph Visualisation in ArchiCAD -- A Combined Graph Schema and Graph Grammar Approach to Consistency in Distributed Modeling -- Improving the Publication Chain through High-Level Authoring Support -- Learning and Rewriting in Fuzzy Rule Graphs -- A Proof Tool Dedicated to Clean -- Image Recognition and Constraint Solving -- Document Table Recognition by Graph Rewriting -- Image Structure from Monotonic Dual Graph Contraction -- Planning Geometric Constraint Decomposition via Optimal Graph Transformations -- Process Modeling and View Integration -- AHEAD: A Graph-Based System for Modeling and Managing Development Processes -- Formalizing UML-Based Process Models Using Graph Transformations -- Formal Integration of Software Engineering Aspects Using a Graph Rewrite System - A Typical Experience ?! - -- Towards Integrating Multiple Perspectives by Distributed Graph Transformation -- Visualization and Animation Tools -- Graph Algorithm Animation with Grrr -- An L-System-Based Plant Modeling Language -- Tool Demonstrations -- TREEBAG — a Short Presentation -- Tool Support for ViewPoint-Oriented Software Development -- UPGRADE — A Framework for Graph-Based Visual Applications -- Generating Diagram Editors with DiaGen -- PROgrammed Graph REwriting System PROGRES -- Testing and Simulating Production Control Systems Using the Fujaba Environment -- L-Studio/cpfg: A Software System for Modeling Plants -- DiTo — A Distribution Tool Based on Graph Rewriting -- A Demonstration of the Grrr Graph Rewriting Programming Language -- AGG: A Tool Environment for Algebraic Graph Transformation -- AGTIVE Workshop/Synmposium Panel Discussion on Industrial Relevance of Graph Transformation: The Reality and Our Dreams -- Best Presentation and Demonstration Awards. |
| Record Nr. | UNINA-9910143636103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Building Tightly Integrated Software Development Environments: The IPSEN Approach [[electronic resource] /] / edited by Manfred Nagl
| Building Tightly Integrated Software Development Environments: The IPSEN Approach [[electronic resource] /] / edited by Manfred Nagl |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (X, 718 p.) |
| Disciplina | 005.1/0285/53 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer engineering Programming languages (Electronic computers) Management information systems Computer science Mathematical logic Software Engineering/Programming and Operating Systems Computer Engineering Software Engineering Programming Languages, Compilers, Interpreters Management of Computing and Information Systems Mathematical Logic and Formal Languages |
| ISBN | 3-540-49578-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Overview: Introduction, classification, and global approach -- The outside perspective: Tools, environments, their integration, and user interface -- Internal conceptual modeling: Graph grammar specifications -- Realization: Derivation of efficient tools -- Current and future work, open problems -- Conclusion: Summary, evaluation, and vision. |
| Record Nr. | UNISA-996465592603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Grammars and Their Application to Computer Science [[electronic resource] ] : 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986 / / edited by Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, Azriel Rosenfeld
| Graph-Grammars and Their Application to Computer Science [[electronic resource] ] : 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986 / / edited by Hartmut Ehrig, Manfred Nagl, Grzegorz Rozenberg, Azriel Rosenfeld |
| Edizione | [1st ed. 1987.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
| Descrizione fisica | 1 online resource (X, 622 p.) |
| Disciplina | 510 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Mathematics
Mathematical logic Software engineering Computer programming Pattern recognition Health informatics Mathematics, general Mathematical Logic and Formal Languages Software Engineering Programming Techniques Pattern Recognition Health Informatics |
| ISBN | 3-540-48178-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tutorial introduction to the algebraic approach of graph grammars -- May we introduce to you: Hyperedge replacement -- An introduction to parallel map generating systems -- Set theoretic approaches to graph grammars -- An introduction to the NLC way of rewriting graphs -- Array grammars -- Graph grammar based specification of interconnection structures for massively parallel computation -- Towards distributed graph grammars -- On partially ordered graph grammars -- A representation of graphs by algebraic expressions and its use for graph rewriting systems -- On context-free sets of graphs and their monadic second-order theory -- Restricting the complexity of regular DNLC languages -- Apex graph grammars -- Graph grammar engineering: A software specification method -- A linguistic formalism for engineering solid modeling -- Graph grammars and diagram editing -- Graphics and their grammars -- On network algebras and recursive equations -- Ada-concurrency specified by graph grammars -- Basic notions of actor grammars -- Embedding rule independent theory of graph grammars -- Supporting the software development process with attributed NLC graph grammars -- Practical applications of precedence graph grammars -- Is parallelism already concurrency? Part 1: Derivations in graph grammars -- Is parallelism already concurrency? Part 2: Non-sequential processes in graph grammars -- Map OL-systems with edge label control: Comparison of marker and cyclic systems -- From 0L and 1L map systems to indeterminate and determinate growth in plant morphogenesis -- Fundamentals of edge-label controlled graph grammars -- Parallelism analysis in rule-based systems using graph grammars -- An efficient algorithm for the solution of hierarchical networks of constraints -- A software development environment based on graph technology -- Map 0L systems with markers -- Graph rewriting with unification and composition -- Complexity of pattern generation via planar parallel binary fission/fusion grammars -- Applications of L-systems to computer imagery -- Advances in array languages -- Rosenfeld's cycle grammars and kolam -- Application of graph grammars in music composing systems -- Boundary NLC and partition controlled graph grammars. |
| Record Nr. | UNISA-996465789203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers / / edited by Juraj Hromkovič, Manfred Nagl, Bernhard Westfechtel
| Graph-Theoretic Concepts in Computer Science : 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers / / edited by Juraj Hromkovič, Manfred Nagl, Bernhard Westfechtel |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XI, 404 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer simulation Algorithms Computer science - Mathematics Numerical analysis Data structures (Computer science) Theory of Computation Simulation and Modeling Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Numeric Computing Data Structures |
| ISBN | 3-540-30559-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Lexicographic Breadth First Search – A Survey -- Wireless Networking: Graph Theory Unplugged -- Graph Algorithms: Trees -- Constant Time Generation of Trees with Specified Diameter -- Treelike Comparability Graphs: Characterization, Recognition, and Applications -- Elegant Distance Constrained Labelings of Trees -- Collective Tree Spanners and Routing in AT-free Related Graphs -- Graph Algorithms: Recognition and Decomposition -- On the Maximum Cardinality Search Lower Bound for Treewidth -- Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs -- Recognizing HHD-free and Welsh-Powell Opposition Graphs -- Bimodular Decomposition of Bipartite Graphs -- Coloring a Graph Using Split Decomposition -- Graph Algorithms: Various Problems -- Decremental Clique Problem -- A Symbolic Approach to the All-Pairs Shortest-Paths Problem -- Minimal de Bruijn Sequence in a Language with Forbidden Substrings -- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic -- Optimization and Approximation Algorithms -- The Computational Complexity of the Minimum Weight Processor Assignment Problem -- A Stochastic Location Problem with Applications to Tele-diagnostic -- A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs -- Tolerance Based Algorithms for the ATSP -- Parameterized Complexity and Exponential Algorithms -- Finding k Disjoint Triangles in an Arbitrary Graph -- Exact (Exponential) Algorithms for the Dominating Set Problem -- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps -- Counting, Combinatorics, and Optimization -- Planar Graphs, via Well-Orderly Maps and Trees -- Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs -- Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters -- Applications (Biology, Graph Drawing) -- Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs -- Octagonal Drawings of Plane Graphs with Prescribed Face Areas -- Crossing Reduction in Circular Layouts -- Graph Classes and NP Hardness -- Characterization and Recognition of Generalized Clique-Helly Graphs -- Edge-Connectivity Augmentation and Network Matrices -- Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size -- The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small -- Core Stability of Minimum Coloring Games. |
| Record Nr. | UNISA-996466372303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-theoretic concepts in computer science : 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004 : revised papers / / Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel (eds.)
| Graph-theoretic concepts in computer science : 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004 : revised papers / / Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2004 |
| Descrizione fisica | 1 online resource (XI, 404 p.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) |
HromkovicJuraj <1958->
NaglManfred WestfechtelBernhard |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Graph theory
Computer science Computer algorithms |
| ISBN | 3-540-30559-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Lexicographic Breadth First Search – A Survey -- Wireless Networking: Graph Theory Unplugged -- Graph Algorithms: Trees -- Constant Time Generation of Trees with Specified Diameter -- Treelike Comparability Graphs: Characterization, Recognition, and Applications -- Elegant Distance Constrained Labelings of Trees -- Collective Tree Spanners and Routing in AT-free Related Graphs -- Graph Algorithms: Recognition and Decomposition -- On the Maximum Cardinality Search Lower Bound for Treewidth -- Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs -- Recognizing HHD-free and Welsh-Powell Opposition Graphs -- Bimodular Decomposition of Bipartite Graphs -- Coloring a Graph Using Split Decomposition -- Graph Algorithms: Various Problems -- Decremental Clique Problem -- A Symbolic Approach to the All-Pairs Shortest-Paths Problem -- Minimal de Bruijn Sequence in a Language with Forbidden Substrings -- A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic -- Optimization and Approximation Algorithms -- The Computational Complexity of the Minimum Weight Processor Assignment Problem -- A Stochastic Location Problem with Applications to Tele-diagnostic -- A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs -- Tolerance Based Algorithms for the ATSP -- Parameterized Complexity and Exponential Algorithms -- Finding k Disjoint Triangles in an Arbitrary Graph -- Exact (Exponential) Algorithms for the Dominating Set Problem -- Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps -- Counting, Combinatorics, and Optimization -- Planar Graphs, via Well-Orderly Maps and Trees -- Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs -- Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters -- Applications (Biology, Graph Drawing) -- Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs -- Octagonal Drawings of Plane Graphs with Prescribed Face Areas -- Crossing Reduction in Circular Layouts -- Graph Classes and NP Hardness -- Characterization and Recognition of Generalized Clique-Helly Graphs -- Edge-Connectivity Augmentation and Network Matrices -- Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size -- The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small -- Core Stability of Minimum Coloring Games. |
| Record Nr. | UNINA-9910483967503321 |
| Berlin, : Springer, 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 21st International Workshop, WG '95, Aachen, Germany, June 20 - 22, 1995. Proceedings / / edited by Manfred Nagl
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 21st International Workshop, WG '95, Aachen, Germany, June 20 - 22, 1995. Proceedings / / edited by Manfred Nagl |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XII, 411 p.) |
| Disciplina | 511.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Graph theory
Computers Algorithms Combinatorics Computer logic Graph Theory Theory of Computation Algorithm Analysis and Problem Complexity Computation by Abstract Devices Logics and Meanings of Programs |
| ISBN | 3-540-48487-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | VC-dimensions for graphs (extended abstract) -- Finding and counting small induced subgraphs efficiently -- On the isomorphism of graphs with few P4s -- A dynamic algorithm for line graph recognition -- Incremental hive graph -- Planarization of graphs embedded on surfaces -- Complexity and approximability of certain bicriteria location problems -- On termination of graph rewriting -- A uniform approach to graph rewriting: The pullback approach -- Visualizing two- and three-dimensional models of meristematic growth -- Graph-theoretical methods to construct entity-relationship databases -- An approximation algorithm for 3-Colourability -- The malleability of TSP 2Opt -- Non-oblivious local search for graph and hypergraph coloring problems -- On Interval Routing Schemes and treewidth -- Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs -- Hot-potato routing on multi-dimensional tori -- On devising Boolean Routing schemes -- Toward a general theory of unicast-based multicast communication -- Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes -- Searching for faulty leaves in binary trees -- NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems -- Efficient parallel modular decomposition (extended abstract) -- Modular decomposition of hypergraphs -- Partition coefficients of acyclic graphs -- Sub-cubic cost algorithms for the all pairs shortest path problem -- Diametral path graphs -- Chordal graphs and their clique graphs -- A compact data structure and parallel algorithms for permutation graphs -- Homogeneously orderable graphs and the Steiner tree problem. |
| Record Nr. | UNISA-996465482803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings / / edited by Manfred Nagl
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 15th International Workshop WG '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings / / edited by Manfred Nagl |
| Edizione | [1st ed. 1990.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
| Descrizione fisica | 1 online resource (XI, 377 p.) |
| Disciplina | 005.74 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Programming languages (Electronic computers) Software engineering Combinatorics Algorithms Computers Data Structures and Information Theory Programming Languages, Compilers, Interpreters Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Computation by Abstract Devices |
| ISBN | 3-540-46950-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Disjoint paths in the hypercube -- Time bounds for broadcasting in bounded degree graphs -- t/s-Diagnosable systems: A characterization and diagnosis algorithm -- Toward a complete representation of graphoids in graphs — Abridged Version -- CADULA — A graph-based model for monitoring CAD-processes -- On hyperedge replacement and BNLC graph grammars -- Graph rewriting systems with priorities -- Filtering hyperedge-replacement languages through compatible properties -- Describing distributed systems by categorical graph grammars -- A parser for context free plex grammars -- to PROGRESS, an attribute graph grammar based specification language -- On the complexity of optimal drawings of graphs -- Bounds to the page number of partially ordered sets -- Beyond Steiner's problem: A VLSI oriented generalization -- A fast sequential and parallel algorithm for the computation of the k-closure of a graph -- On feedback problems in digraphs -- Improved self-reduction algorithms for graphs with bounded treewidth -- Finding a minimal transitive reduction in a strongly connected digraph within linear time -- Paging binary trees with external balancing -- The complexity of graph problems for succinctly represented graphs -- An O(n log n) algorithm for 1-D tile compaction -- Weighted parallel triangulation of simple polygons -- Implementing data structures on a hypercube multiprocessor, and applications in parallel computational geometry -- k — Nearest — Neighbor Voronoi diagrams for sets of convex polygons, line segments and points -- Finding squares and rectangles in sets of points -- Combinatorial properties of abstract Voronoi diagrams. |
| Record Nr. | UNISA-996465845303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||