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-Theoretic Concepts in Computer Science [[electronic resource] ] : 20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings / / edited by Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 20th International Workshop. WG '94, Herrsching, Germany, June 16 - 18, 1994. Proceedings / / edited by Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XI, 425 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Discrete mathematics Algorithms Combinatorics Computer logic Theory of Computation Discrete Mathematics Algorithm Analysis and Problem Complexity Logics and Meanings of Programs |
| ISBN | 3-540-49183-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Domino treewidth -- A lower bound for treewidth and its consequences -- Tree-width and path-width of comparability graphs of interval orders -- A declarative approach to graph based modeling -- Multilevel graph grammars -- The algorithmic use of hypertree structure and maximum neighbourhood orderings -- On domination elimination orderings and domination graphs -- Complexity of graph covering problems -- Dominoes -- GLB-closures in directed acyclic graphs and their applications -- Minimum vertex cover, distributed decision-making, and communication complexity -- Cartesian products of graphs as spanning subgraphs of de Bruijn graphs -- Specification of graph translators with triple graph grammars -- Using programmed graph rewriting for the formal specification of a configuration management system -- Exponential time analysis of confluent and boundary eNCE graph languages -- Time-optimal tree computations on sparse meshes -- Prefix graphs and their applications -- The complexity of broadcasting in planar and decomposable graphs -- The maximal f-dependent set problem for planar graphs is in NC -- On-line convex planarity testing -- Book embeddings and crossing numbers -- Measuring the distance to series-parallelity by path expressions -- Labelled trees and pairs of input-output permutations in priority queues -- Rankings of graphs -- Bypass strong V-structures and find an isomorphic labelled subgraph in linear time -- Efficient algorithms for a mixed k-partition problem of graphs without specifying bases -- Fugitive-search games on graphs and related parameters -- New approximation results on graph matching and related problems -- New lower bounds and hierarchy results for restricted branching programs -- On-line algorithms for satisfiability problems with uncertainty -- NC algorithms for antidirected hamiltonian paths and cycles in tournaments -- Directed path graph isomorphism. |
| Record Nr. | UNISA-996465930103316 |
| 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] ] : 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings / / edited by Gunther Schmidt, Rudolf Berghammer
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 17th International Workshop WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings / / edited by Gunther Schmidt, Rudolf Berghammer |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (VIII, 256 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science—Mathematics
Algorithms Combinatorics Computers Data structures (Computer science) Logic design Mathematics of Computing Algorithm Analysis and Problem Complexity Computation by Abstract Devices Data Structures Logic Design |
| ISBN | 3-540-46735-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Approximating treewidth, pathwidth, and minimum elimination tree height -- Monadic second-order evaluations on tree-decomposable graphs -- Optimal embedding of complete binary trees into lines and grids -- Graph rewriting systems and their application to network reliability analysis -- Nondeterministic control structures for graph rewriting systems -- A language for generic graph-transformations -- Attributed elementary programmed graph grammars -- The complexity of approximating the class Steiner tree problem -- On complexity of some chain and antichain partition problems -- Tight bounds for the rectangular art gallery problem -- Voronoi diagrams of moving points in the plane -- Using maximal independent sets to solve problems in parallel -- Fast parallel algorithms for coloring random graphs -- Optimal vertex ordering of a graph and its application to symmetry detection -- Edge separators for graphs of bounded genus with applications -- Line digraph iterations and the spread concept—with application to graph theory, fault tolerance, and routing -- A generalized encryption scheme based on random graphs -- Dynamic algorithms for shortest paths in planar graphs -- Complete problems for logspace involving lexicographic first paths in graphs -- A new upper bound on the complexity of the all pairs shortest path problem -- On the crossing number of the hypercube and the cube connected cycles -- Logic arrays for interval indicator functions -- On the broadcast time of the butterfly network -- On disjoint cycles -- Short disjoint cycles in cubic bridgeless graphs. |
| Record Nr. | UNISA-996465640103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : International Workshop WG '86 Bernried, Federal Republic of Germany, June 17-19, 1986, Proceedings / / edited by Gottfried Tinhofer, Gunther Schmidt
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : International Workshop WG '86 Bernried, Federal Republic of Germany, June 17-19, 1986, Proceedings / / edited by Gottfried Tinhofer, Gunther Schmidt |
| Edizione | [1st ed. 1987.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
| Descrizione fisica | 1 online resource (X, 314 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Combinatorics Computer communication systems Theory of Computation Computation by Abstract Devices Computer Communication Networks |
| ISBN | 3-540-47415-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A simple linear-time algorithm to recognize interval graphs -- On approximation algorithms for Steiner's problem in graphs -- Specification of error distances for graphs by precedence graph grammars and fast recognition of similarity -- ADA concurrency specified by graph grammars -- Cabri, an interactive system for graph manipulation -- An interactive graphical manipulation system for higher objects based on relational algebra -- Behaviour preserving refinements of Petri nets -- The bandwidth of planar distributive lattices -- The node visit cost of brother trees -- Searching connected components in very large grid graphs -- A simple implementation of Warshall's algorithm on a vlsi chip -- On some generalizations of outerplanar graphs: Results and open problems -- Recognizing outerplanar graphs in linear time -- Graphs and graph polynomials of interest in chemistry -- Applications of parallel scheduling to perfect graphs -- A graph-theoretic approach for designing fair distributed resource scheduling algorithms -- Improved diameter bounds for altered graphs -- Separability of sets of polygons -- Centipede graphs and visibility on a cylinder -- The diameter of connected components of random graphs -- An algorithm for testing planarity of hierarchical graphs -- EDM — A data model for electronic CAD/CAM-applications. |
| Record Nr. | UNISA-996465674403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Modelling Potential Malaria Spread in Germany by Use of Climate Change Projections : A Risk Assessment Approach Coupling Epidemiologic and Geostatistical Measures / / by Winfried Schröder, Gunther Schmidt
| Modelling Potential Malaria Spread in Germany by Use of Climate Change Projections : A Risk Assessment Approach Coupling Epidemiologic and Geostatistical Measures / / by Winfried Schröder, Gunther Schmidt |
| Autore | Schröder Winfried |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (66 p.) |
| Disciplina |
550
614.4 |
| Collana | SpringerBriefs in Environmental Science |
| Soggetto topico |
Climate change
Parasitology Epidemiology Geobiology Climate Change Climate Change/Climate Change Impacts Biogeosciences |
| ISBN | 3-319-03823-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Background and Goals -- 2. Case Study 1: Modelling Potential Transmission Gates of Malaria Tertiana in Lower Saxony -- 3. Case Study 2: Modelling Potential Transmission Gates of Malaria Tertiana in Germany -- 4. Conclusions and Outlook. |
| Record Nr. | UNINA-9910298380003321 |
Schröder Winfried
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Relational Structures as Knowledge Instruments [[electronic resource] ] : COST Action 274, TARSKI, Revised Papers / / edited by Harrie de Swart, Ewa Orlowska, Gunther Schmidt, Marc Roubens
| Theory and Applications of Relational Structures as Knowledge Instruments [[electronic resource] ] : COST Action 274, TARSKI, Revised Papers / / edited by Harrie de Swart, Ewa Orlowska, Gunther Schmidt, Marc Roubens |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (VIII, 280 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computer science—Mathematics Mathematical logic Database management Artificial intelligence Programming Techniques Symbolic and Algebraic Manipulation Mathematical Logic and Formal Languages Database Management Artificial Intelligence |
| ISBN |
1-280-30665-3
9786610306657 3-540-24615-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | RelView and Rath – Two Systems for Dealing with Relations -- The GUHA Method and Foundations of (Relational) Data Mining -- Mechanised Reasoning and Model Generation for Extended Modal Logics -- Theory Extraction in Relational Data Analysis -- An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them I: Language Extension Mechanisms -- Consistent Representation of Rankings -- Axiomatic and Strategic Approaches to Bargaining Problems -- Categoric and Ordinal Voting: An Overview -- Relational Models of Lambek Logics -- Approximation Operators in Qualitative Data Analysis -- Lattice–Based Relation Algebras and Their Representability -- Binary Multirelations. |
| Record Nr. | UNISA-996465907703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theory and Applications of Relational Structures as Knowledge Instruments : COST Action 274, TARSKI, Revised Papers / / edited by Harrie de Swart, Ewa Orlowska, Gunther Schmidt, Marc Roubens
| Theory and Applications of Relational Structures as Knowledge Instruments : COST Action 274, TARSKI, Revised Papers / / edited by Harrie de Swart, Ewa Orlowska, Gunther Schmidt, Marc Roubens |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (VIII, 280 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computer science—Mathematics Logic, Symbolic and mathematical Database management Artificial intelligence Programming Techniques Symbolic and Algebraic Manipulation Mathematical Logic and Formal Languages Database Management Artificial Intelligence |
| ISBN |
1-280-30665-3
9786610306657 3-540-24615-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | RelView and Rath – Two Systems for Dealing with Relations -- The GUHA Method and Foundations of (Relational) Data Mining -- Mechanised Reasoning and Model Generation for Extended Modal Logics -- Theory Extraction in Relational Data Analysis -- An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them I: Language Extension Mechanisms -- Consistent Representation of Rankings -- Axiomatic and Strategic Approaches to Bargaining Problems -- Categoric and Ordinal Voting: An Overview -- Relational Models of Lambek Logics -- Approximation Operators in Qualitative Data Analysis -- Lattice–Based Relation Algebras and Their Representability -- Binary Multirelations. |
| Record Nr. | UNINA-9910144210103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Theory and Applications of Relational Structures as Knowledge Instruments II [[electronic resource] ] : International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers / / edited by Harrie de Swart, Ewa Orlowska, Gunther Schmidt, Marc Roubens
| Theory and Applications of Relational Structures as Knowledge Instruments II [[electronic resource] ] : International Workshops of COST Action 274, TARSKI, 2002-2005, Selected Revised Papers / / edited by Harrie de Swart, Ewa Orlowska, Gunther Schmidt, Marc Roubens |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (X, 373 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Computers
Artificial intelligence Computer science—Mathematics Mathematical logic Database management Theory of Computation Artificial Intelligence Symbolic and Algebraic Manipulation Mathematical Logic and Formal Languages Database Management |
| ISBN | 3-540-69224-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Social Software for Coalition Formation -- Investigating Finite Models of Non-classical Logics with Relation Algebra and RelView -- On the Logic of Medical Decision Support -- Generalizing and Modifying the Hoede-Bakker Index -- An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics -- Relational Approach to Order-of-Magnitude Reasoning -- Relational Logics and Their Applications -- Fuzzy Information Relations and Operators: An Algebraic Approach Based on Residuated Lattices -- Aggregation of Fuzzy Relations and Preservation of Transitivity -- Flexible Query Answering Using Distance-Based Fuzzy Relations -- General Representation Theorems for Fuzzy Weak Orders -- Relational Representation Theorems for Lattices with Negations: A Survey -- Lattice-Based Relation Algebras II -- Some Aspects of Lattice and Generalized Prelattice Effect Algebras -- A Decision Procedure for Monotone Functions over Bounded and Complete Lattices -- The Dominance Relation on the Class of Continuous T-Norms from an Ordinal Sum Point of View -- Aggregation on Bipolar Scales. |
| Record Nr. | UNISA-996466150103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||