Graph Multiset Transformation as a Framework for Massively Parallel Computation

@inproceedings{Kreowski2008GraphMT,
  title={Graph Multiset Transformation as a Framework for Massively Parallel Computation},
  author={Hans-J{\"o}rg Kreowski and Sabine Kuske},
  booktitle={ICGT},
  year={2008}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

Termination Criteria for Model Transformation

Transformation Techniques in Software Engineering • 2005
View 2 Excerpts

The Design of Innovation: Lessons from and for Competent Genetic Algorithms

D. E. Goldberg
Addison-Wesley, Reading • 2002
View 1 Excerpt

DNA Computing — New Computing Paradigms

G. Păun, G. Rozenberg, A. Salomaa
Springer, Heidelberg • 1998
View 1 Excerpt

Similar Papers

Loading similar papers…