Termination of graph rewriting is undecidable
Fundamenta Informaticae
Graph transformation units and modules
Handbook of graph grammars and computing by graph transformation
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
More About Control Conditions for Transformation Units
TAGT'98 Selected papers from the 6th International Workshop on Theory and Application of Graph Transformations
Computational Completeness of Programming Languages Based on Graph Transformation
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Termination Detection of Distributed Algorithms by Graph Relabelling Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
A sight-seeing tour of the computational landscape of graph transformation
Formal and natural computing
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Evolutionary Computation: Toward a New Philosophy of Machine Intelligence (IEEE Press Series on Computational Intelligence)
Graph Multiset Transformation as a Framework for Massively Parallel Computation
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Termination criteria for model transformation
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be applied to all or at least some members of a multiset of graphs simultaneously providing a computational step with the possibility of massive parallelism in this way. As a consequence, graph problems in the class NP can be solved by a single computation of polynomial length for each input graph.