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 Grammars and Their Application to Computer Science [[electronic resource] ] : 4th International Workshop, Bremen, Germany, March 5-9, 1990. Proceedings / / edited by Hartmut Ehrig, Hans-Jörg Kreowski, Grzegorz Rozenberg
| Graph Grammars and Their Application to Computer Science [[electronic resource] ] : 4th International Workshop, Bremen, Germany, March 5-9, 1990. Proceedings / / edited by Hartmut Ehrig, Hans-Jörg Kreowski, Grzegorz Rozenberg |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (X, 706 p.) |
| Disciplina | 004/.01/5115 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Applied mathematics
Engineering mathematics Computers Mathematical logic Software engineering Artificial intelligence Pattern recognition Applications of Mathematics Theory of Computation Mathematical Logic and Formal Languages Software Engineering Artificial Intelligence Pattern Recognition |
| ISBN | 3-540-38395-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A note on hyperedge replacement -- Graph grammars based on node rewriting: an introduction to NLC graph grammars -- Tutorial introduction to the algebraic approach of graph grammars based on double and single pushouts -- The logical expression of graph properties -- Panel discussion: The use of graph grammars in applications -- GraphEd: An interactive tool for developing graph grammars -- Presentation of the IPSEN-Environment: An Integrated and Incremental Project Support ENviroment -- Presentation of the PROGRESS-Editor: A text-oriented hybrid editor for PROgrammed Graph REwriting SyStems -- PLEXUS: Tools for analyzing graph grammars -- An algebraic theory of graph reduction -- Programming with very large graphs -- Describing Göttler's operational graph grammars with pushouts -- General solution to a system of recursive equations on hypergraphs -- Construction of map OL-systems for developmental sequences of plant cell layers -- Layout graph grammars: The placement approach -- Cycle chain code picture languages -- An efficient implementation of graph grammars based on the RETE matching algorithm -- An application of graph grammars to the elimination of redundancy from functions defined by schemes -- Graphic equivalence and computer optimization -- Graph grammars and logic programming -- Graphs as relational structures : An algebraic and logical approach -- Context-free handle-rewriting hypergraph grammars -- From graph grammars to high level replacement systems -- Algebraic specification grammars: A junction between module specifications and graph grammars -- A characterization of context-free NCE graph languages by monadic second-order logic on trees -- The term generating power of context-free hypergraph grammars -- Elementary actions on an extended entity-relationship database -- Physically-based graphical interpretation of marker cellwork L-systems -- Dactl: An experimental graph rewriting language -- Use graph grammars to design CAD-systems ! -- Collage grammars -- The four musicians: analogies and expert systems — a graphic approach -- Structured transformations and computation graphs for actor grammars -- Grammatical inference based on hyperedge replacement -- Specifying concurrent languages and systems with ?-grammars -- Graph rewriting in some categories of partial morphisms -- Application of graph grammars to rule-based systems -- Tree automata, tree decomposition and hyperedge replacement -- Recognizing rooted context-free flowgraph languages in polynomial time -- Computing with graph relabelling systems with priorities -- Double-wall cellwork systems for plant meristems -- Programmed derivations of relational structures -- A specification environment for graph grammars -- The theory of graphoids: A survey -- Graph-reducible term rewriting systems -- A note on graph decimation -- Progress: A VHL-language based on graph grammars -- Movement of objects in configuration spaces modelled by graph grammars -- Recognizing edge replacement graph languages in cubic time -- Computing by graph transformation: Overall aims and new results. |
| Record Nr. | UNISA-996465652903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings / / edited by Jan van Leeuwen
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings / / edited by Jan van Leeuwen |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (XI, 437 p.) |
| Disciplina | 004/.01/5115 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Discrete mathematics Application software Algorithms Combinatorics Computer logic Theory of Computation Discrete Mathematics Computer Applications Algorithm Analysis and Problem Complexity Logics and Meanings of Programs |
| ISBN | 3-540-48385-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Near-optimal dominating sets in dense random graphs in polynomial expected time -- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality -- Hierarchically specified unit disk graphs -- Bounded tree-width and LOGCFL -- On reduction algorithms for graphs with small treewidth -- Algorithms and complexity of sandwich problems in graphs (extended abstract) -- On-line graph algorithms for incremental compilation -- Average case analysis of fully dynamic connectivity for directed graphs -- Fully dynamic maintenance of vertex cover -- Dynamic algorithms for graphs with treewidth 2 -- Short disjoint cycles in graphs with degree constraints -- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs -- Towards a solution of the Holyer's problem -- Graphs, hypergraphs and hashing -- Coloring k-colorable graphs in constant expected parallel time -- Deciding 3-colourability in less than O(1.415n) steps -- A rainbow about T-colorings for complete graphs -- Approximating the chromatic polynomial of a graph -- Asteroidal triple-free graphs -- The parallel complexity of elimination ordering procedures -- Dually chordal graphs -- The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions -- Regular marked Petri nets -- The asynchronous committee meeting problem -- Gossiping in vertex-disjoint paths mode in interconnection networks -- The folded Petersen network: A new versatile multiprocessor interconnection topology -- Fast load balancing in Cayley graphs and in circuits -- Concurrent flows and packet routing in Cayley graphs (Preliminary version) -- On multi-label linear interval routing schemes -- An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages -- Linear layouts of generalized hypercubes -- Graph ear decompositions and graph embeddings -- Improved bounds for the crossing numbers on surfaces of genus g -- Two algorithms for finding rectangular duals of planar graphs -- A more compact visibility representation. |
| Record Nr. | UNISA-996466261003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||